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.
https://hal.inria.fr/hal-00689746
Contributor : Alexander Zeh
<>
Submitted on : Wednesday, July 18, 2012 - 8:48:18 AM
Last modification on : Monday, March 4, 2019 - 1:44:09 PM
Document(s) archivé(s) le : Friday, October 19, 2012 - 2:22:11 AM
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⟩
