巡回符号における提案された下界と既知の下界に関する計算法について

抄録

It is shown that the proposed lower bound by the authors in 2010 is greater than or equal to the BCH bound for any cyclic codes. Discussion of relationship between the proposed lower bound and the Hartmann-Zeng bound is also given. For these discussions three improved algorithms from the authors' algorithm are described.