Papers
Topics
Authors
Recent
Search
2000 character limit reached

Self-Dual and Complementary Dual Abelian Codes over Galois Rings

Published 15 Jun 2014 in math.RA | (1406.3794v3)

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 ${\rm GR}(pr,s)[G]$, where $G$ is a finite abelian group and ${\rm GR}(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 ${\rm GR}(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 ${\rm GR}(pr,s)[G]$ is completely and explicitly determined. Applying known results on cyclic codes of length $pa$ over ${\rm GR}(p2,s)$, an explicit formula for the number of self-dual abelian codes in ${\rm GR}(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 ${\rm GR}(pr,s)[G]$ are established. The analogous results for self-dual and complementary dual cyclic codes over Galois rings are therefore obtained as corollaries.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.