Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound
Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound
复制标题
对超出 Hartmann-Tzeng 界限的某些类别的二进制循环码进行高效解码
DOI：
10.1109/isit.2011.6033683
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
S. Bezzateev
中科院分区：
文献类型：
--
作者：
Alexander Zeh;A. Wachter;S. Bezzateev
提出了二元循环码距离的一个新的界。该方法是基于由有理函数的生成多项式的根的子集的表示。证明了最小距离的一个新的界，并确定了几类二元循环码。对于某些类型的码，这个界比已知的界（例如BCH或Hartmann-Tzeng界）更好。此外，二次时间解码算法，这一新的界限。
A new bound on the distance of binary cyclic codes is proposed. The approach is based on the representation of a subset of the roots of the generator polynomial by a rational function. A new bound on the minimum distance is proven and several classes of binary cyclic codes are identified. For some classes of codes, this bound is better than the known bounds (e.g. BCH or Hartmann-Tzeng bound). Furthermore, a quadratic-time decoding algorithm up to this new bound is developed.
将循环码解码到最小距离的新界限
影响因子：
2.5
作者：
Alexander Zeh;Antonia Wachter-Zeh;Sergey V. Bezzateev
通讯作者：
Sergey V. Bezzateev