Dihedral codes with prescribed minimum distance (Q2232216): Difference between revisions

The authors introduce dihedral codes as left ideals in the group algebra \(\mathbb{F}_qD_{2m},\) where \(\mathbb{F}_q\) denotes a finite field and \(D_{2m}\) a dihedral group of order \(2m.\) They investigate the algebraic structure of those codes, especially their generating polynomials and their relation to their duals. The authors give conditions when a dihedral code is a principal ideal or when it is the sum of two principal ideals. In Theorem 1, the authors give a generator polynomial for a principal dihedral code and in Corollary 1 they give a lower bound for the minimum distance of that code. Further, the authors prove that the dual code of a dihedral code is dihedral as well (Proposition 1). In Theorem 2, the BCH bound for principal dihedral codes is given. In the binary case (Section 3.4), the equivalence of some conditions if proven by the authors. Finally, the authors give some open problems in the last section. For the entire collection see [Zbl 1470.11003].