Z 2 Z 4 -Additive Quasi-Cyclic codes
Résumé
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 linear codes derived from the Z2Z4-additive quasi-cyclic codes that meet the Griesmer bound with equality.
Fichier principal
Final4_version_Z2Z4-additive_quasi-cyclic_codes.pdf (320.61 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)