Key equations for list decoding of Reed-Solomon codes and how to solve them

DOI10.1016/j.jsc.2010.03.010zbMath1191.94129OpenAlexW1983029360MaRDI QIDQ975823

Kristian Brander, Beelen, Peter

Publication date: 11 June 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.03.010

zbMATH Keywords

interpolationReed-Solomon codeslist decodingGuruswami-Sudan algorithm

Mathematics Subject Classification ID

Decoding (94B35)

Related Items

Computing minimal interpolation bases ⋮ Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ Simplified High-Speed High-Distance List Decoding for Alternant Codes

Cites Work

• Unnamed Item
• Unnamed Item
• List decoding of Reed-Solomon codes from a Gröbner basis perspective
• Decoding of Reed Solomon codes beyond the error-correction bound
• Gröbner basis solutions of constrained interpolation problems
• A displacement approach to efficient decoding of algebraic-geometric codes
• Algebraic Codes on Lines, Planes, and Curves
• Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• On the key equation

This page was built for publication: Key equations for list decoding of Reed-Solomon codes and how to solve them