Skip to Main content Skip to Navigation
Journal articles

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
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-00710290
Contributor : Alexander Zeh <>
Submitted on : Wednesday, August 29, 2012 - 11:26:14 AM
Last modification on : Tuesday, December 17, 2019 - 10:10:03 AM
Long-term archiving on: : Friday, December 16, 2016 - 8:21:23 AM

Files

ZehBezzateev_BoundMinimumDista...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00710290, version 3
  • ARXIV : 1206.4976

Collections

Citation

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

Share

Metrics

Record views

501

Files downloads

661