Combinatorial bounds for list decoding
From MaRDI portal
Publication:4674491
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
(38)- Explicit capacity-achieving list-decodable codes
- Robustly reusable fuzzy extractor with imperfect randomness
- The Complexity of Local List Decoding
- List-decoding Barnes-Wall lattices
- List decodability at small radii
- Limits to List Decoding Random Codes
- Efficient List Decoding of Explicit Codes with Optimal Redundancy
- Low-density parity-check codes achieve list-decoding capacity
- scientific article; zbMATH DE number 3970683 (Why is no real title available?)
- scientific article; zbMATH DE number 7758311 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2081105 (Why is no real title available?)
- 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
- Singleton-type bounds for list-decoding and list-recovery, and related results
- Two theorems on list decoding (extended abstract)
- Bounds on list decoding of MDS codes
- Erasure list-decodable codes and Turán hypercube problems
- Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- Extractors from Reed-Muller codes
- Improved list-decodability of random linear binary codes
- List decoding algorithms for certain concatenated codes
- Combinatorial Limitations of Average-Radius List Decoding
- Decision List Compression by Mild Random Restrictions
- Bridging Shannon and Hamming: list error-correction with optimal rate
- Algorithmic Results in List Decoding
- scientific article; zbMATH DE number 1420994 (Why is no real title available?)
- List decoding from erasures: bounds and code constructions
- On the list-decodability of random linear codes
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Explicit List-decodable codes with optimal rate for computationally bounded channels
- 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)
