A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Designs, Codes and Cryptography Year : 2012

A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes

Abstract

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndromes and formulate a Key Equation that allows an efficient decoding up to our bound with the Extended Euclidean Algorithm. It turns out that lowest-code-rate cyclic codes with small minimum distances are useful for our approach. Therefore, we give a sufficient condition for binary cyclic codes of arbitrary length to have minimum distance two or three and lowest code-rate
Fichier principal
Vignette du fichier
ZehBezzateev_BoundMinimumDistance_hal_arxiv.pdf (355.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00710290 , version 1 (20-06-2012)
hal-00710290 , version 2 (11-07-2012)
hal-00710290 , version 3 (29-08-2012)

Identifiers

Cite

Alexander Zeh, Sergey Bezzateev. A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes. Designs, Codes and Cryptography, 2012, pp.229-246. ⟨hal-00710290v3⟩
333 View
416 Download

Altmetric

Share

Gmail Facebook X LinkedIn More