Low-Density Parity-Check Codes Achieve List-Decoding Capacity
From MaRDI portal
Publication:5020732
DOI10.1137/20M1365934zbMath1502.94048arXiv1909.06430OpenAlexW3215304434MaRDI QIDQ5020732
Shashwat Silas, Nicolas Resch, Jonathan Mosheiff, Noga Ron-Zewi, Mary Wootters
Publication date: 7 January 2022
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06430
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear-time list recovery of high-rate expander codes
- Thresholds versus fractional expectation-thresholds
- Thresholds in the lattice of subspaces of \(\mathbb{F}_q^n\)
- Explicit subspace designs
- Some remarks on multiplicity codes
- Expander codes
- Iterative Decoding of Low-Density Parity Check Codes (A Survey)
- List decoding from erasures: bounds and code constructions
- Graphical Models, Exponential Families, and Variational Inference
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- A recursive approach to low complexity codes
- On expander codes
- Combinatorial bounds for list decoding
- On the weight distribution of random binary linear codes
- Local List Recovery of High-Rate Tensor Codes and Applications
- On List Recovery of High-Rate Tensor Codes
- Analysis of Boolean Functions
- List Decoding with Double Samplers
- Every list-decodable code for high noise has abundant near-optimal rate puncturings
- On the List-Decodability of Random Linear Codes
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes
- Folded codes from function field towers and improved optimal rate list decoding
- Subspace evasive sets
- List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
- On the list decodability of random linear codes with large error rates
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear Codes
- Information Theory and Statistics: A Tutorial
