Efficient Interpolation in the Guruswami–Sudan Algorithm

DOI10.1109/TIT.2010.2053901MaRDI QIDQ5281295zbMATH OpenFDO

Authors P. V. Trifonov

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• A Syndrome Formulation of the Interpolation Step in the Guruswami-Sudan Algorithm
• A fast algorithm for optimal linear interpolation
• scientific article; zbMATH DE number 2127858
• Efficient algorithms for Hermite interpolation
• Algorithms for optimal spline interpolation
• A new efficient algorithm for polynomial interpolation
• Efficient Algorithms for Periodic Hermite Spline Interpolation
• Smooth interpolation of data by efficient algorithms
• scientific article; zbMATH DE number 1273635
• A fast algorithm for Nevanlinna-Pick interpolation

Cited in

(1)

• Simplified High-Speed High-Distance List Decoding for Alternant Codes

This page was built for publication: Efficient Interpolation in the Guruswami–Sudan Algorithm

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