Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
From MaRDI portal
Publication:3604484
DOI10.1109/TIT.2007.911222zbMath1205.94125arXivcs/0511072OpenAlexW2146078064MaRDI QIDQ3604484
Atri Rudra, Venkatesan Guruswami
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0511072
Related Items
Computing minimal interpolation bases ⋮ Parallel Hashing via List Recoverability ⋮ Linear-time list recovery of high-rate expander codes ⋮ On the Error-Correcting Radius of Folded Reed–Solomon Code Designs ⋮ Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes ⋮ Explicit subspace designs ⋮ List Decoding of Binary Codes–A Brief Survey of Some Recent Results ⋮ Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction ⋮ NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ Privacy-Preserving Support Vector Machines with Flexible Deployment and Error Correction ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes ⋮ Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Unnamed Item ⋮ A novel elementary construction of matching vectors ⋮ Optimal rate algebraic list decoding using narrow ray class fields ⋮ Variety evasive sets ⋮ Group homomorphisms as error correcting codes ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings ⋮ Algebraic decoding of folded Gabidulin codes ⋮ Nearly optimal robust secret sharing ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Optimal Rate List Decoding via Derivative Codes ⋮ Unnamed Item ⋮ High-rate codes with sublinear-time decoding ⋮ List-Decoding with Double Samplers ⋮ Rank-Metric Codes and Their Applications ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity
This page was built for publication: Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
