On the minimum distance of certain reversible cyclic codes (Corresp.)
On the minimum distance of certain reversible cyclic codes (Corresp.)
复制标题
DOI：
10.1109/tit.1970.1054517
复制
发表时间：
1970-09
期刊：
影响因子：
--
通讯作者：
K. Tzeng;C. Hartmann
中科院分区：
文献类型：
--
作者：
K. Tzeng;C. Hartmann
证明了一类可逆循环码的最小距离大于BCH界所给出的距离。值得注意的是，这类码包括Melas的本原纠错二进制码以及Zetterberg发现的作为特例的非本原纠错二进制码。
The minimum distance of a class of reversible cyclic codes has been proved to be greater than that given by the BCH bound. It is also noted that this class of codes includes the class of primitive double-error-correcting binary codes of Melas as well as the class of nonprimitive double-error-correcting binary codes discovered by Zetterberg as special cases.