A New Bound for the Minimum Distance of a Cyclic Code From Its Defining Set

A new lower bound for the distance of cyclic codes is proposed. This bound depends on the defining set of the code, like several other bounds. The proposed bound improves upon the Bose–Chaudhuri–Hocquehghen (BCH) bound and, for some codes, improves upon the Hartmann–Tzeng bound and the Roos bound as well.