Describing A Cyclic Code by Another Cyclic Code
Information Theory
2013-06-10 v4 math.IT
Abstract
A new approach to bound the minimum distance of -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.
Cite
@article{arxiv.1204.4563,
title = {Describing A Cyclic Code by Another Cyclic Code},
author = {Alexander Zeh and Sergey Bezzateev},
journal= {arXiv preprint arXiv:1204.4563},
year = {2013}
}