Dihedral Codes with Prescribed Minimum Distance - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2021

Dihedral Codes with Prescribed Minimum Distance

Résumé

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.
Fichier principal
Vignette du fichier
2003.11125.pdf (180.48 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03852303 , version 1 (14-11-2022)

Identifiants

Citer

Martino Borello, Abdelillah Jamous. Dihedral Codes with Prescribed Minimum Distance. Arithmetic of Finite Fields, 12542, Springer International Publishing, pp.147-159, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-68869-1_8⟩. ⟨hal-03852303⟩
6 Consultations
30 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More