Dihedral codes with prescribed minimum distance

DOI10.1007/978-3-030-68869-1_8MaRDI QIDQ2232216zbMATH OpenOpenAlexFDO

Authors Martino Borello, Abdelillah Jamous

Publication date 4 October 2021

Full work available at URL https://arxiv.org/abs/2003.11125

zbMATH Keywords

BCH bounddihedral codesgroup algebras

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Abstract: Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the binary case, we present some examples of optimal dihedral codes obtained by this construction.

Review text

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].

Recommendations

• A note on some classes of good group codes
• Left dihedral codes over finite chain rings
• Left dihedral codes over Galois rings \(\mathrm{GR}(p^2, m)\)
• Construction and enumeration of left dihedral codes satisfying certain duality properties
• Central and non central codes of dihedral 2-groups

Cites work

• A [45,13] code with minimal distance 16
• A Group Ring Construction of the Extended Binary Golay Code
• A new presentation of Cheng-Sloane's \([32,17,8]\)-code
• Algebraic cryptanalysis of McEliece variants with compact keys
• COMPUTING THE DIMENSION OF IDEALS IN GROUP ALGEBRAS, WITH AN APPLICATION TO CODING THEORY
• Concatenated structure of left dihedral codes
• Fundamentals of Error-Correcting Codes
• Group codes over fields are asymptotically good
• scientific article; zbMATH DE number 3131967 (Why is no real title available?)
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• Observations on group rings
• On quasi-cyclic codes as a generalization of cyclic codes
• On the additive cyclic structure of quasi-cyclic codes
• On the divisors of a^k + b^k
• On the theory of group codes
• Reducing Key Length of the McEliece Cryptosystem
• Some randomized code constructions from group actions
• The extended Golay codes considered as ideals
• Une generalisation de la construction de berman des codes de reed et muller p-aires

Cited in

(13)

• Left dihedral codes over finite chain rings
• On equivalence of cyclic and dihedral zero-divisor codes having nilpotents of nilpotency degree two as generators
• Construction and enumeration of left dihedral codes satisfying certain duality properties
• On the dimension of ideals in group algebras, and group codes
• Central and non central codes of dihedral 2-groups
• On checkable codes in group algebras
• On BCH split metacyclic codes
• Matrix product structure of left generalized quaternion group codes
• Dihedral quantum codes
• Dihedral codes with 1-dimensional hulls and 1-dimensional linear complementary pairs of dihedral codes
• On codes from split metacyclic groups
• A [45,13] code with minimal distance 16
• A note on some classes of good group codes

This page was built for publication: Dihedral codes with prescribed minimum distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232216)