Optimal Codes for the Coverage Depth Problem and the Performance of Random Codes Q94QXG67CK

URI	`m2://res/Q94QXG67CK`
Kind	preprint
Creators	Roee Gross, Yitzchak Grunbaum, Matteo Bertuzzo, Eitan Yaakobi, Alberto Ravagnani
Date	2026-10-05
MSC	05-XX
Subjects	arxiv cs.IT, arxiv math.IT
Scope	in

Expressions

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

Item	Kind	Where	Source
Constant-redundancy regime	statement	theorem VII.4	arxiv
1S71FBMV17	statement	theorem V.1	arxiv
\text{see	statement	theorem II.2	arxiv
48NQA5PKP8	definition	definition VI.3	arxiv
4VTM091X0C	statement	lemma VI.3	arxiv
6FW7N3D0X2	statement	lemma VII.1	arxiv
\text{see	statement	theorem II.1	arxiv
915KME2085	statement	lemma VII.2	arxiv
BPGPR52AGR	statement	lemma VI.2	arxiv
F834ZBADH2	statement	corollary 1	arxiv
FG0PEKYS2K	statement	theorem IV.1	arxiv
H2A538T34M	statement	theorem III.2	arxiv
HKH41KDAPX	statement	theorem VI.1	arxiv
\textbf{The optimal coverage depth problem	problem	problem 1	arxiv
K6PX0MV81M	definition	definition VI.2	arxiv
KYA3PXT104	definition	definition VII.2	arxiv
NFQAY9869Z	definition	definition VI.1	arxiv
NGDQYA9BM7	definition	definition VII.1	arxiv
P2WJ3YDH3H	statement	lemma III.1	arxiv
Constant-rate regime	statement	theorem VII.3	arxiv
SJKCJ54MF4	statement	lemma 1	arxiv
\text{see	statement	theorem II.3	arxiv
W25MRE41E3	statement	corollary 2	arxiv
WENY4G8W60	statement	corollary 3	arxiv
XE99AXJRHB	statement	lemma IV.2	arxiv