Back to Search
Start Over
ℤ₂ℤ₄-Additive Quasi-Cyclic Codes.
- Source :
-
IEEE Transactions on Information Theory . Nov2021, Vol. 67 Issue 11, p7232-7239. 8p. - Publication Year :
- 2021
-
Abstract
- We study the codes of the title by the CRT method, that decomposes such codes into constituent codes, which are shorter codes over larger alphabets. Criteria on these constituent codes for self-duality and linear complementary duality of the decomposed codes are derived. The special class of the one-generator codes is given a polynomial representation and exactly enumerated. In particular, we present some illustrative examples of binary optimal linear codes with respect to the Griesmer bound derived from the $\mathbb {Z}_{2} \mathbb {Z}_{4}$ -additive quasi-cyclic codes. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 67
- Issue :
- 11
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 153710534
- Full Text :
- https://doi.org/10.1109/TIT.2021.3111858