Author :
Kasami, Tadao ; Lin, Shu ; Peterson, W. Wesley
fDate :
11/1/1968 12:00:00 AM
Abstract :
A class of cyclic codes is introduced by a polynomial approach that is an extension of the Mattson-Solomon method and of the Muller method. This class of codes contains several important classes of codes as subclasses, namely, BCH codes, Reed-Solomon codes, generalized primitive Reed-Muller codes, and finite geometry codes. Certain fundamental properties of this class of codes are derived. Some subclasses are shown to be majority-logic decodable.
Keywords :
BCH codes; Geometry codes; Polynomial codes; Reed-Muller codes; Reed-Solomon codes; Character generation; Circuits; Decoding; Geometry; Information processing; Operations research; Optimal control; Reed-Solomon codes; Relaxation methods; Statistics;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1968.1054226
