Abelian group factorization from cyclic and quasi-cyclic codes
Authors:
- 14 October 2020
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Discrete Mathematics, Algorithms and Applications
- Vol. 13 (02)
Abstract
In this paper, we use the algebraic structures of cyclic codes and algorithmic techniques to find factorizations of abelian groups from cyclic codes. We construct specific subclasses of quasi-cyclic codes and provide the conditions with which we obtain a normalized factorization of certain abelian groups. The factorization, in both cases, is constituted by two sets, one corresponding to the cyclic code and the other corresponding to the words that represent all possible error polynomials of the cyclic code besides the zero vector.Keywords
This publication has 5 references indexed in Scilit:
- A Connection Between Block and Convolutional CodesSIAM Journal on Applied Mathematics, 1979
- Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.)IEEE Transactions on Information Theory, 1978
- Lookaside Techniques for Minimum Circuit Memory TranslatorsIEEE Transactions on Computers, 1973
- Circulant bases for cyclic codes (Corresp.)IEEE Transactions on Information Theory, 1970
- Self-orthogonal quasi-cyclic codesIEEE Transactions on Information Theory, 1967