Quasi-abelian codes

From MaRDI portal
Publication:2260786

DOI10.1007/S10623-013-9878-4zbMATH Open1342.94122DBLPjournals/dcc/JitmanL15arXiv1406.3794OpenAlexW1987064052WikidataQ62577989 ScholiaQ62577989MaRDI QIDQ2260786FDOQ2260786


Authors: Somphong Jitman, San Ling Edit this on Wikidata


Publication date: 12 March 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes over Galois rings are studied in terms of the ideals in the group ring mGR(pr,s)[G], where G is a finite abelian group and mGR(pr,s) is a Galois ring. Characterizations of self-dual abelian codes have been given together with necessary and sufficient conditions for the existence of a self-dual abelian code in mGR(pr,s)[G]. A general formula for the number of such self-dual codes is established. In the case where gcd(|G|,p)=1, the number of self-dual abelian codes in mGR(pr,s)[G] is completely and explicitly determined. Applying known results on cyclic codes of length pa over mGR(p2,s), an explicit formula for the number of self-dual abelian codes in mGR(p2,s)[G] are given, where the Sylow p-subgroup of G is cyclic. Subsequently, the characterization and enumeration of complementary dual abelian codes in mGR(pr,s)[G] are established. The analogous results for self-dual and complementary dual cyclic codes over Galois rings are therefore obtained as corollaries.


Full work available at URL: https://arxiv.org/abs/1406.3794




Recommendations




Cites Work


Cited In (19)

Uses Software





This page was built for publication: Quasi-abelian codes

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