The n-dimensional key equation and a decoding application

DOI10.1109/18.272482MaRDI QIDQ4307292zbMATH OpenOpenAlexFDO

Authors Hervé Chabanne, G. H. Norton

Publication date 4 October 1994

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

Full work available at URL https://doi.org/10.1109/18.272482

zbMATH Keywords

cyclic codedecodingerror-locator polynomiallinear recurring sequences

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Recommendations

• General Error Locator Polynomials for Binary Cyclic Codes With <formula formulatype="inline"><tex>$t \le 2$</tex></formula> and <formula formulatype="inline"> <tex>$n &lt; 63$</tex></formula>
• scientific article; zbMATH DE number 493099
• A code decomposition approach for decoding cyclic and algebraic-geometric codes
• General principles for the algebraic decoding of cyclic codes

Cited in

(4)

• The key equation for one-point codes and efficient error evaluation
• Multidimensional cyclic codes and Artin-Schreier type hypersurfaces over finite fields
• scientific article; zbMATH DE number 493099 (Why is no real title available?)
• scientific article; zbMATH DE number 7385926 (Why is no real title available?)

This page was built for publication: The n-dimensional key equation and a decoding application

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