A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
From MaRDI portal
Publication:3540917
DOI10.1007/978-3-540-87448-5_3zbMath1166.94357MaRDI QIDQ3540917
Publication date: 25 November 2008
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87448-5_3
94B27: Geometric methods (including applications of algebraic geometry) applied to coding theory
94B15: Cyclic codes
94B35: Decoding
Cites Work
- Unnamed Item
- Algebraic function fields and codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- 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
- Decoding of Hermitian codes: the key equation and efficient error evaluation
- List decoding of algebraic-geometric codes
- Algebraic Functions and Projective Curves
- Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis