On the minimum distance of certain reversible cyclic codes (Corresp.)
Kenneth K. Tzeng, Carlos R. P. Hartmann · IEEE Transactions on Information Theory · 1970
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.