On Generalized Reed-Muller Codes and Their Relatives

P. Delsarte,J. Goethals,F. MacWilliams

Published 1970 in Information and Control

ABSTRACT

The polynomial formulation of generalized ReedMuller codes, first introduced by Kasami, Lin, and Peterson is somewhat formalized and an extensive study is made of the interrelations between the m-variable approach of Kasami, Lin, and Peterson and the one-variable approach of Mattson and Solomon. The automorphism group is studied in great detail, both in the m-variable and in the one-variable language. The number of minimum weight vectors is obtained in the general case. Two ways of restricting generalized ReedMuller codes to subcodes are studied: the nonprimitive and the subfield subcodes. Connections with geometric codes are pointed out and a new series of majority decodable codes is introduced.

PUBLICATION RECORD

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-19 of 19 references · Page 1 of 1

CITED BY

Showing 1-100 of 266 citing papers · Page 1 of 3