Combinatorial bounds for list decoding
From MaRDI portal
Publication:4674491
DOI10.1109/18.995539zbMATH Open1061.94074OpenAlexW2154198326WikidataQ56958981 ScholiaQ56958981MaRDI QIDQ4674491FDOQ4674491
Authors: David Zuckerman, Venkatesan Guruswami, Johan Hastad, Madhu Sudan 
Publication date: 11 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.995539
Recommendations
- Two theorems on list decoding (extended abstract)
- On the list-decodability of random linear codes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Limits to List Decoding Random Codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
Cited In (30)
- Robustly reusable fuzzy extractor with imperfect randomness
- The Complexity of Local List Decoding
- List-decoding Barnes-Wall lattices
- Limits to List Decoding Random Codes
- List decodability at small radii
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Title not available (Why is that?)
- Title not available (Why is that?)
- List Decoding of Binary Codes–A Brief Survey of Some Recent Results
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
- Error-correcting codes for list decoding
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithmic Results in List Decoding
- Simple extractors via constructions of cryptographic pseudo-random generators
- Improved lower bounds on the sizes of error-correcting codes for list decoding
- Two theorems on list decoding (extended abstract)
- Bounds on list decoding of MDS codes
- Extractors from Reed-Muller codes
- Decision List Compression by Mild Random Restrictions
- Combinatorial Limitations of Average-Radius List Decoding
- Bridging Shannon and Hamming: list error-correction with optimal rate
- Low-Density Parity-Check Codes Achieve List-Decoding Capacity
- Algorithmic Results in List Decoding
- Title not available (Why is that?)
- List decoding from erasures: bounds and code constructions
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Bounds for codes in the case of list decoding of finite volume
This page was built for publication: Combinatorial bounds for list decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674491)
