In this paper it is shown that both the BCH bound and the Hartmann-Tzeng bound for the minimum distance of a cyclic code can be obtained quite easily as consequences of an elementary result concerning the defining set of its zeros. © 1982.
Roos, C. (1982). A generalization of the BCH bound for cyclic codes, including the Hartmann-Tzeng bound. Journal of Combinatorial Theory, Series A, 33(2), 229–232. https://doi.org/10.1016/0097-3165(82)90014-0