Quasi-abelian codes

From MaRDI portal




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.





Describes a project that uses

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)