Self-Dual and Complementary Dual Abelian Codes over Galois Rings

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 GR(pr,s)[G], where G is a finite abelian group and 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 GR(pr,s)[G]. A general formula for the number of such self-dual codes is established. In the case where (|G|,p)=1, the number of self-dual abelian codes in GR(pr,s)[G] is completely and explicitly determined. Applying known results on cyclic codes of length pa over GR(p2,s), an explicit formula for the number of self-dual abelian codes in 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 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…