Describing A Cyclic Code by Another Cyclic Code - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Describing A Cyclic Code by Another Cyclic Code

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.
Fichier principal
Vignette du fichier
ZehBezzateev_DescribingACyclicCodeByAnotherCyclicCode_halIsitfinal.pdf (141.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00689746 , version 1 (20-04-2012)
hal-00689746 , version 2 (23-04-2012)
hal-00689746 , version 3 (26-04-2012)
hal-00689746 , version 4 (18-07-2012)

Identifiers

Cite

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⟩
261 View
182 Download

Altmetric

Share

Gmail Facebook X LinkedIn More