The concatenated structure of quasi-abelian codes
From MaRDI portal
Publication:2109388
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.
Recommendations
Cites work
- Complementary dual codes for counter-measures to side-channel attacks
- Construction of quasi-cyclic self-dual codes
- Double circulant and quasi-twisted self-dual codes over \(\mathbb F_5\) and \(\mathbb F_7\)
- Good self-dual quasi-cyclic codes exist
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3485627 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284436 (Why is no real title available?)
- scientific article; zbMATH DE number 7642508 (Why is no real title available?)
- Linear codes with complementary duals
- Linear codes with complementary duals meet the Gilbert-Varshamov bound
- Multidimensional Quasi-Cyclic and Convolutional Codes
- On automorphism groups of binary linear codes
- On quasi-abelian complementary dual codes
- On the additive cyclic structure of quasi-cyclic codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- Quasi-abelian codes
- Quasi-cyclic complementary dual codes
- Split group codes
- The concatenated structure of cyclic and Abelian codes
- The Concatenated Structure of Quasi-Cyclic Codes and an Improvement of Jensen's Bound
- The Magma algebra system. I: The user language
- Thresholds of Random Quasi-Abelian Codes
Cited in
(4)
This page was built for publication: The concatenated structure of quasi-abelian codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109388)