Describing A Cyclic Code by Another Cyclic Code

Alexander Zeh 1, 2 Sergey Bezzateev 3
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
Inria Saclay - Ile de France
2 INT - University of Ulm. - Institute of Communications Engineering [Ulm]
3 SUAI - Saint Petersburg University of Aerospace Instrumentation
Abstract : A new approach to bound the minimum distance of $q$-ary cyclic codes is presented. The connection to the BCH and the Hartmann--Tzeng bound is formulated and it is shown that for several cases an improvement is achieved. We associate a second cyclic code to the original one and bound its minimum distance in terms of parameters of the associated code.
Keywords : Hartmann--Tzeng Bound BCH Bound Cyclic Code
Type de document :
Communication dans un congrès
Guiseppe Caire and Michelle Effros and Hans-Andrea Loeliger and Alexander Vardy. IEEE International Symposium on Information Theory (ISIT), Jul 2012, Boston, United States. IEEE, pp.2896-2900, 2012, <10.1109/ISIT.2012.6284054>
Liste complète des métadonnées

https://hal.inria.fr/hal-00689746
Contributeur : Alexander Zeh <>
Soumis le : mercredi 18 juillet 2012 - 08:48:18
Dernière modification le : jeudi 9 février 2017 - 15:48:28
Document(s) archivé(s) le : vendredi 19 octobre 2012 - 02:22:11

Fichiers

ZehBezzateev_DescribingACyclic...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

INRIA | INSMI | PARISTECH | TDS-MACS

Citation

Alexander Zeh, Sergey Bezzateev. Describing A Cyclic Code by Another Cyclic Code. Guiseppe Caire and Michelle Effros and Hans-Andrea Loeliger and Alexander Vardy. IEEE International Symposium on Information Theory (ISIT), Jul 2012, Boston, United States. IEEE, pp.2896-2900, 2012, <10.1109/ISIT.2012.6284054>. <hal-00689746v4>

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de
la notice

165

Téléchargements du document

86

Contact


archive-ouverte@inria.fr