Skip to Main content Skip to Navigation
Conference papers

Describing A Cyclic Code by Another Cyclic Code

Alexander Zeh 1, 2 Sergey Bezzateev 3
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
2 INT - University of Ulm. - Institute of Communications Engineering [Ulm]
3 SUAI - Saint-Petersburg State 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
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
https://hal.inria.fr/hal-00689746
Contributor : Alexander Zeh Connect in order to contact the contributor
Submitted on : Wednesday, July 18, 2012 - 8:48:18 AM
Last modification on : Friday, November 22, 2019 - 1:37:11 AM
Long-term archiving on: : Friday, October 19, 2012 - 2:22:11 AM

Files

Vignette du document
ZehBezzateev_DescribingACyclic...
Files produced by the author(s)

Identifiers

Collections

INRIA | INSMI | TDS-MACS | LIX | X-LIX | X | X-DEP-INFO | CNRS

Citation

Alexander Zeh, Sergey Bezzateev. Describing A Cyclic Code by Another Cyclic Code. IEEE International Symposium on Information Theory (ISIT), Jul 2012, Boston, United States. pp.2896-2900, ⟨10.1109/ISIT.2012.6284054⟩. ⟨hal-00689746v4⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

465

Files downloads

402

 

Contact                    Legal Notice                    Personal Data