scientific article; zbMATH DE number 1284422

From MaRDI portal
Publication:4242016





\{For the netire collection see Zbl 0907.94001 \}. As the author very nicely puts it: ``Quadratic residue codes are some of the brightest gem of coding theory. Their facets reflect many topics: quadratic residues and reciprocity; multiply transitive and sporadic simple groups; lattices; group representations; and block designs and Hadamard matrices. A natural framework to study quadratic residue codes is the group algebra codes, codes that are ideals in the group algebra of a finite group. Sections from 1 to 4 provide an introduction to them, including a development of the character theory needed in the case when the group is commutative. Sections from 5 to 11 form an exposition of the generalized quadratic residue codes covering their main features; including restrictions on the alphabet field, duality properties, the extended codes, and group actions (the Gleason-Prange theorem), the square-root bound on minimum weights, global codes, and designs. A code is called divisible if all codeword weights have a nontrivial common divisor. Sections from 12 to 16 give an introduction to ideas involved in the study of divisibility. The Gleason-Pierce theorem of Section 13 provides a link between duality and divisibility, and the theorem of Ax in Section 14 explains divisibility in Reed-Muller codes. Generalizations of Ax's theorem can be found in Section 15. In Section 16, a character formula for the weight function is applied to another divisibility result and theorem of MacWilliams. For the entire collection see [Zbl 0907.94001].











This page was built for publication:

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