Self-orthogonal quasi-abelian codes are asymptotically good

DOI10.1016/J.FFA.2021.101958MaRDI QIDQ2066385zbMATH OpenOpenAlexFDO

Authors Bocong Chen, Guanghui Zhang

Publication date 14 January 2022

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ffa.2021.101958

zbMATH Keywords

asymptotically good codesrandom quasi-abelian codesself-orthogonal codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Review text

The authors work with codes as left ideals of a group algebra over a finite field. This is a well-known approach and it enables the authors to introduce self-orthogonal quasi-abelian group codes to the reader. Section 2 contains counting formulas. In Section 3, the authors investigate the weight enumerators of the introduced self-dual codes. In Section 4, especially Theorem 4.1, the authors give a basis for a self-dual quasi-abelian code, which is asymptotically good.

Recommendations

• Quasi-abelian codes
• scientific article; zbMATH DE number 7124325
• On quasi-abelian complementary dual codes
• Group codes over fields are asymptotically good
• scientific article; zbMATH DE number 7642508

Cites work

• A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
• Asymptotically good quasi-cyclic codes of fractional index
• Codes Closed under Arbitrary Abelian Group of Permutations
• Dihedral Group Codes Over Finite Fields
• Good self-dual quasi-cyclic codes exist
• scientific article; zbMATH DE number 3133919 (Why is no real title available?)
• scientific article; zbMATH DE number 7642508 (Why is no real title available?)
• Is the class of cyclic codes asymptotically good?
• Limit distribution of the minimum distance of random linear codes
• New lower bounds for the minimal distance of linear quasicyclic and almost linear cyclic codes
• Probability and Computing
• Quasi-Cyclic Codes of Index $1\frac {1}{3}$
• Self-Dual Doubly Even $2$-Quasi-Cyclic Transitive Codes Are Asymptotically Good
• Some randomized code constructions from group actions
• Some results on quasi-cyclic codes
• Thresholds of Random Quasi-Abelian Codes

Cited in

(5)

• Asymptotic bound on binary self-orthogonal codes
• Asymptotically good \(\mathbb{Z}_p\mathbb{Z}_p[u]/\langle u^t\rangle\)-additive cyclic codes
• On additive quasi-abelian codes over finite fields and their duality properties
• On quasi-abelian codes over finite commutative chain rings and their dual codes
• Asymptotically good LCD 2-quasi-abelian codes over finite chain rings

This page was built for publication: Self-orthogonal quasi-abelian codes are asymptotically good

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2066385)