Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
From MaRDI portal
Publication:4976034
DOI10.1109/TIT.2009.2034780zbMath1366.94690OpenAlexW2168219305MaRDI QIDQ4976034
Swastik Kopparty, Eli Ben-Sasson
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2009.2034780
Related Items (9)
On the list decodability of rank-metric codes containing Gabidulin codes ⋮ Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius ⋮ A characterization of cyclic subspace codes via subspace polynomials ⋮ 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 ⋮ Cyclic constant dimension subspace codes via the sum of Sidon spaces ⋮ Constructions of cyclic constant dimension codes ⋮ Improvements on the Johnson bound for Reed-Solomon codes ⋮ Unnamed Item
This page was built for publication: Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes
