Answers are grounded in this paper and cite their sources.
First it is shown that all binary Reed-Muller codes with one digit dropped can be made cyclic by rearranging the digits. Then a natural generalization to the nonbinary case is presented, which also includes the Reed-Muller codes and Reed-Solomon codes as special cases. The generator polynomial is characterized and the minimum weight is established. Finally, some results on weight distribution are given.
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: