Decoding Cyclic Codes up to a New Bound on the Minimum Distance

A new lower bound on the minimum distance of q -ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem bound and, for some codes, upon the Hartmann-Tzeng bound. Several Boston bounds are special cases of our bound. For some classes of codes, the bound on the minimum di...

Ausführliche Beschreibung