A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm

DOI10.1007/978-3-540-87448-5_3zbMATH Open1166.94357OpenAlexW1563963325MaRDI QIDQ3540917FDOQ3540917

Authors: Peter Beelen, Tom Høholdt 

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

Recommendations

• scientific article
• A Decoding Approach to Reed–Solomon Codes from Their Definition
• List decoding of Reed-Solomon codes from a Gröbner basis perspective
• Interpolation in list decoding of Reed-Solomon codes
• Decoding Reed-Solomon codes beyond \((d-1)/2\) and zeros of multivariate polynomials

Mathematics Subject Classification ID

Cyclic codes (94B15) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

Cites Work

• List decoding of algebraic-geometric codes
• Algebraic function fields and codes
• Algebraic Functions and Projective Curves
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon Codes
• Efficient decoding of Reed-Solomon codes beyond half the minimum distance
• Decoding of Hermitian codes: the key equation and efficient error evaluation
• Syndrome Decoding of Reed–Solomon Codes Beyond Half the Minimum Distance Based on Shift-Register Synthesis
• Title not available (Why is that?)

Cited In (1)

• Efficient Interpolation in the Guruswami–Sudan Algorithm

This page was built for publication: A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540917)