Skip to Main content Skip to Navigation
Conference papers

Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes

Abstract : Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved. Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them.
Complete list of metadata

https://hal.inria.fr/hal-00828083
Contributor : Alexander Zeh <>
Submitted on : Wednesday, June 26, 2013 - 2:45:16 PM
Last modification on : Friday, February 5, 2021 - 3:48:40 AM

Links full text

Identifiers

  • HAL Id : hal-00828083, version 1
  • ARXIV : 1301.6231

Citation

Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev. Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. IEEE International Symposium on Information Theory (ISIT), Jul 2013, Istanbul, Turkey. pp.1-6. ⟨hal-00828083⟩

Share

Metrics

Record views

659