On Blahut's decoding algorithms for two-dimensional BCH codes

DOI10.1109/18.651066MaRDI QIDQ4392471zbMATH OpenOpenAlexFDO

Authors H. S. Madhusudhana, Mohammad Umar Siddiqi

Publication date 10 August 1998

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

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

zbMATH Keywords

Blahut's burst-errordecoding algorithmlinear complexityquasi-cyclic burst-errortwo-dimensional BCH codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Decoding (94B35)

Recommendations

• Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
• scientific article; zbMATH DE number 493099
• On algebraic soft-decision decoding algorithms for BCH codes
• Simple algorithms for BCH decoding
• Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

Cited in

(3)

• Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
• scientific article; zbMATH DE number 493099 (Why is no real title available?)
• Using BL-algebras for codes

This page was built for publication: On Blahut's decoding algorithms for two-dimensional BCH codes

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