Comparison of two algorithms for decoding alternant codes

DOI10.1007/S002000050103MaRDI QIDQ1277244zbMATH OpenOpenAlexFDO

Authors Patrick Fitzpatrick, Sylvia M. Jennings

Publication date 14 November 1999

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002000050103

zbMATH Keywords

computational complexitydecoding algorithmserror correcting alternant code

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decoding (94B35)

Review text

The computational complexity of two algorithms for decoding of a \(t\)-error correcting alternant code is estimated. These codes include BCH, Reed-Solomon, and classical Goppa codes. Also a new improved version of the algorithm is given.

Recommendations

• On PGZ decoding of alternant codes
• Publication:4945364
• scientific article; zbMATH DE number 3924676
• Simplified High-Speed High-Distance List Decoding for Alternant Codes

Cited in

(10)

• On PGZ decoding of alternant codes
• Gröbner basis approach to list decoding of algebraic geometry codes
• scientific article; zbMATH DE number 4147506 (Why is no real title available?)
• scientific article; zbMATH DE number 45703 (Why is no real title available?)
• A comparison of known codes, random codes, and the best codes
• scientific article; zbMATH DE number 1424168 (Why is no real title available?)
• Decoding of Interleaved Alternant Codes
• An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
• Gröbner bases over Galois rings with an application to decoding alternant codes
• The impact of alternant codes over Eisenstein integers on modern technology

This page was built for publication: Comparison of two algorithms for decoding alternant codes

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