Singleton-type bounds for list-decoding and list-recovery, and related results
From MaRDI portal
Publication:6187335
DOI10.1016/j.jcta.2023.105835arXiv2112.05592MaRDI QIDQ6187335
Chong Shangguan, Itzhak Tamo, Unnamed Author
Publication date: 15 January 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.05592
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an extremal hypergraph problem of Brown, Erdős and Sós
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- On membership comparable sets
- Code bounds for multiple packings over a nonbinary finite alphabet
- Combinatorial Limitations of Average-Radius List-Decoding
- Error-correcting codes for list decoding
- Polynomial Codes Over Certain Finite Fields
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
- Improving the Gilbert–Varshamov Bound for<tex>$q$</tex>-Ary Codes
- Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
- Linear time encodable and list decodable codes
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- List Decoding of Burst Errors
- Bounds for List-Decoding and List-Recovery of Random Linear Codes
- Sparse Hypergraphs with Applications to Coding Theory
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
- Channel capacities for list codes
- A Lower Bound on List Size for List Decoding
- Limits to List Decoding Random Codes
- On coloring graphs to maximize the proportion of multicolored k-edges
- Pseudorandom generators without the XOR lemma
This page was built for publication: Singleton-type bounds for list-decoding and list-recovery, and related results
