Some cyclic codes and a scheme for decoding by a majority of tests

Cyclic codes permitting majority decoding are considered. A geometrical interpretation of majority decoding based on finite projective geometry is introduced. The use of this geometrical model facilitates the discovery of codes (similar to the Bose–Chaudhuri codes) with simple decoding schemes.