The Concatenated Structure of Quasi-Abelian Codes
Preprint
Abstract
The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in (Jitman, Ling, (2015)), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling, Sol\'e, (2001)). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases. In addition, examples of large strictly quasi-abelian codes of about a half rate are given. The concatenated structure also enables us to conclude that strictly quasi-abelian linear complementary dual codes over any finite field are asymptotically good.Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- On the additive cyclic structure of quasi-cyclic codesDiscrete Mathematics, 2018
- Quasi-cyclic complementary dual codesFinite Fields and Their Applications, 2016
- Quasi-abelian codesDesigns, Codes and Cryptography, 2013
- Linear codes with complementary duals meet the Gilbert–Varshamov boundDiscrete Mathematics, 2004
- Good self-dual quasi-cyclic codes existIEEE Transactions on Information Theory, 2003
- On the algebraic structure of quasi-cyclic codes .I. Finite fieldsIEEE Transactions on Information Theory, 2001
- Split group codesIEEE Transactions on Information Theory, 2000
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Linear codes with complementary dualsDiscrete Mathematics, 1992
- The concatenated structure of cyclic and Abelian codesIEEE Transactions on Information Theory, 1985