Decoding binary 2-D cyclic codes by the 2-D Berlekamp-Massey algorithm
- 1 July 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (4) , 1200-1203
- https://doi.org/10.1109/18.86974
Abstract
A method of decoding two-dimensional (2-D) cyclic codes by applying the 2-D Berlekamp-Massey algorithm is proposed. To explain this decoding method, the author introduces a subclass of 2-D cyclic codes, which are called 2-D BCH codes due to their similarity with BCH codes. It is shown that there are some short 2-D cyclic codes with a better cost parameter value. The merit of the approach is verified by showing several simple examples of 2-D cyclic codesKeywords
This publication has 8 references indexed in Scilit:
- Extension of the Berlekamp-Massey algorithm to N dimensionsInformation and Computation, 1990
- Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacitiesIEEE Transactions on Information Theory, 1988
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional arrayJournal of Symbolic Computation, 1988
- Some algebraic tools for error-correcting codesPublished by Springer Nature ,1986
- The concatenated structure of cyclic and Abelian codesIEEE Transactions on Information Theory, 1985
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their dualsIEEE Transactions on Information Theory, 1981
- Binary Codes Which Are Ideals in the Group Algebra of an Abelian GroupBell System Technical Journal, 1970
- Semisimple cyclic and Abelian codes. IICybernetics and Systems Analysis, 1970