The concatenated structure of cyclic and Abelian codes
- 1 November 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 31 (6) , 788-793
- https://doi.org/10.1109/tit.1985.1057109
Abstract
It is shown that a linear two-dimensional cyclic code of lengthnNcan be factorized into a direct sum of concatenated codes, with cyclic inner and outer codes and, conversely, thai a two-dimensional cyclic code can be constructed in this way. This result is extended, and it appears that the Abelian codes are obtainable by taking a direct sum of several concatenations of cyclic codes. Codes are constructed that are better than any previously known. In particular, low-rate cyclic codes superior to the duals of high-rate BCH codes are constructed.Keywords
This publication has 10 references indexed in Scilit:
- New binary codes constructed by an old technique (Corresp.)IEEE Transactions on Information Theory, 1983
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their dualsIEEE Transactions on Information Theory, 1981
- The minimum distance of all binary cyclic codes of odd lengths from 69 to 99IEEE Transactions on Information Theory, 1978
- A theory of two-dimensional cyclic codesInformation and Control, 1977
- Construction and decomposition of cyclic codes of composite length (Corresp.)IEEE Transactions on Information Theory, 1974
- Some long cyclic linear binary codes are not so badIEEE Transactions on Information Theory, 1974
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- 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
- Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH CodesIEEE Transactions on Information Theory, 1969