On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes

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 bound and the Hartmann-Zeng bound is also given. For these discussions three improved algorithms from the authors' algorithm are described.