Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes

DOI10.1109/TIT.2013.2246813zbMath1364.94607OpenAlexW2013452229MaRDI QIDQ5346487

Carol J. Wang, Venkatesan Guruswami

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2013.2246813

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (16)

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 and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques ⋮ Improved List Decoding of Folded Reed-Solomon and Multiplicity 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 ⋮ Local List Recovery of High-Rate Tensor Codes and Applications ⋮ Optimal rate algebraic list decoding using narrow ray class fields ⋮ Lossless dimension expanders via linearized polynomials and subspace designs ⋮ Explicit list-decodable codes with optimal rate for computationally bounded channels ⋮ Subspace designs based on algebraic function fields ⋮ Unnamed Item ⋮ Lifted Multiplicity Codes and the Disjoint Repair Group Property ⋮ Rank-Metric Codes and Their Applications ⋮ Low-Density Parity-Check Codes Achieve List-Decoding Capacity

This page was built for publication: Linear-Algebraic List Decoding for Variants of Reed–Solomon Codes