Improvements on the Johnson bound for Reed-Solomon codes

DOI10.1016/j.dam.2008.06.014zbMath1163.94434OpenAlexW2088572324MaRDI QIDQ1028479

Sandeep Sen, V. N. Muralidhara

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.06.014

zbMATH Keywords

list decodabilityReed Solomon codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Cites Work

• Unnamed Item
• Decoding of Reed Solomon codes beyond the error-correction bound
• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• Learning Polynomials with Queries: The Highly Noisy Case
• Explicit capacity-achieving list-decodable codes
• Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
• Limits to List Decoding Reed–Solomon Codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes

This page was built for publication: Improvements on the Johnson bound for Reed-Solomon codes