Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics Année : 2023

Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes

Adel Alahmadi
Patrick Solé
Ramy Taki Eldin

Résumé

We recall a classic lower bound on the minimum Hamming distance of constacyclic codes over finite fields, analogous to the well-known BCH bound for cyclic codes. This BCH-like bound serves as a foundation for proposing some minimum-distance lower bounds for single-generator quasi-twisted (QT) codes. Associating each QT code with a constacyclic code over an extension field, we obtain the first bound. This is the QT analogue to a result in the literature for quasi-cyclic codes. We point out some weaknesses in this bound and propose a novel bound that takes into account the Chinese remainder theorem approach to QT codes as well as the BCH bound of constacyclic codes. This proposed bound, in contrast to previous bounds in the literature, does not presuppose a specific form of code generator and does not require calculations in any extension field. We illustrate that our bound meets the one in the literature when the code generator adheres to the specific form assumed in that study. Various numerical examples enable us to compare and discuss these bounds.
Fichier principal
Vignette du fichier
mathematics-11-02539.pdf (315.42 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04113136 , version 1 (01-06-2023)

Identifiants

Citer

Adel Alahmadi, Patrick Solé, Ramy Taki Eldin. Lower Bound on the Minimum Distance of Single-Generator Quasi-Twisted Codes. Mathematics , 2023, 11 (11), pp.2539. ⟨10.3390/math11112539⟩. ⟨hal-04113136⟩
10 Consultations
9 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More