New generalizations of the Reed-Muller codes--I: Primitive codes

From MaRDI portal





An earlier remark of \textit{N. Zierler} [On a variation of the first-order Reed-Muller codes, October 1958], namely that the first-order Reed-Muller codes with one digit dropped can be made cyclic by rearranging the digits is generalized for the entire class of Reed-Muller codes. This property leads to a \(q\)-nary generalization of the Reed-Muller codes, called primitive generalized Reed-Muller (GRM) codes, which are different and in some cases better codes than the generalizations of \textit{B. M. Dwork} and \textit{R. M. Heller} [Results of a geometric approach to the theory and construction of non-binary multiple error and failure correcting codes, IRE Natl. Conv. Rec., 123--129 (1959)]. The GRM codes are proved to be invariant under the doubly transitive affine group of permutation and therefore in particular the RM-codes have that property and hence can be used for the obtention of certain balanced incomplete block designs. The generator polynomial of GRM codes is characterized and the minimum weight established and particularized for RM-codes, finding in that way new information on weight distribution of RM-codes.




Cited in
(87)








This page was built for publication: New generalizations of the Reed-Muller codes--I: Primitive codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5546457)