Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Kasami et al. (1968) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: