On a class of majority-logic decodable cyclic codes
J.-M. Goethals, P. Delsarte · IEEE Transactions on Information Theory · 1968
A new infinite class of cyclic codes is studied. Codes of this class can be decoded in a step-by-step manner, using` majority logic. Some previously known codes fall in this class, and thus admit simpler decoding procedures. As random error-correcting codes, the codes are nearly as powerful as the Bose-Chaudhuri codes.