Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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

Résumé

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.

Dates et versions

hal-00828083 , version 1 (26-06-2013)

Identifiants

Citer

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⟩
367 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More