Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound

Résumé

A new bound on the distance of binary cyclic codes is proposed. The approach is based on the representation of a subset of the roots of the generator polynomial by a rational function. A new bound on the minimum distance is proven and several classes of binary cyclic codes are identified. For some classes of codes, this bound is better than the known bounds (e.g. BCH or Hartmann-Tzeng bound). Furthermore, a quadratic-time decoding algorithm up to this new bound is developed.
Fichier principal
Vignette du fichier
isit2011.pdf (345.89 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-00647590 , version 1 (02-12-2011)

Identifiants

Citer

Alexander Zeh, Antonia Wachter-Zeh, Sergey Bezzateev. Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound. IEEE International Symposium on Information Theory (ISIT), Jul 2011, St. Petersburg, Russia. pp.1017-1021, ⟨10.1109/ISIT.2011.6033683⟩. ⟨hal-00647590⟩
624 Consultations
226 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More