Abstract : In recent years, much work has been done in the area of majority logic decoding, and with good reasons. In the first place, majority logic decoding can be very simply implemented. While the BCH codes are the best known class of codes for correcting large multiple errors, the complexityof its implementation leaves something to be desired. On the other hand, although most of the known majority logic decodable codes are somewhat inferior to the BCH codes, the simplicity of a majority logic decoder and the ease of decoding give this method of decoding an attractive prospect. Secondly, majority logic decoding automatically corrects many more patterns of errors other than those guaranteed by the decoding schemes without any additional equipment. This can be achieved by the BCH codes only with a lot of extra equipment. These two features of the majority logic decoding are motivations enough for its further study. (Author)