Self-dual binary -codes constructed by left ideals of the dihedral group algebra
Abstract: Let be an arbitrary positive integer and be a dihedral group of order $8m$, i.e., . Left ideals of the dihedral group algebra are called binary left dihedral codes of length $8m$, and abbreviated as binary left -codes. In this paper, we give an explicit representation and enumeration for all distinct self-dual binary left -codes. These codes make up an important class of self-dual binary -codes such that the dihedral group is necessary a subgroup of the automorphism group of each code. In particular, we provide recursive algorithms to solve congruence equations over finite chain rings for constructing all distinct self-dual binary left -codes and obtain a Mass formula to count the number of all these self-dual codes. As a preliminary application, we obtain the extremal self-dual binary -code and an extremal self-dual binary -code from self-dual binary left -codes and left -codes respectively.
Paper Prompts
Sign up for free to create and run prompts on this paper.