Decoding binary two-error correcting cyclic codes with Zech logarithms

DOI10.1109/26.192400MaRDI QIDQ4035895zbMATH OpenOpenAlexFDO

Authors Patrick Stevens, Harold N. Ward

Publication date 16 May 1993

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

BCH codesfinite fieldgenerator polynomialsdecoding algorithmZech logarithmbinary two-error correcting cyclic codes

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>
• Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
• On a Class of Reversible Binary Cyclic Codes and their Algebraic Decoding
• Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e&lt;e/sub BCH/
• A decoding procedure for multiple-error-correcting cyclic codes

Cited in

(2)

• scientific article; zbMATH DE number 820496 (Why is no real title available?)
• Algebraic decoding of the Zetterberg codes

This page was built for publication: Decoding binary two-error correcting cyclic codes with Zech logarithms

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