We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea
On the Reed-Muller codes
✍ Scribed by E.F. Assmus Jr
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 632 KB
- Volume
- 106-107
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
Assmus Jr, E.F., On the Reed-Muller codes, Discrete Mathematics 106/107 (1992) 25-33.
We give a brief but complete account of all the essential facts concerning the Reed-Muller and punctured
Reed-Muller codes. The treatment is new and includes an easy, direct proof of the fact that the punctured Reed-Muller codes are the codes of the projective geometries over the binary field. We also establish the existence of two short exact sequences that lead to new proofs that the minimum-weight vectors of the Reed-Muller and punctured Reed-Muller codes are the incidence vectors of the appropriate geometric objects.
📜 SIMILAR VOLUMES
We study trellises of Reed}Muller codes from "rst principles. Our approach to local trellis behaviour seems to be new and yields amongst other things another proof of a result of Berger and Be'ery on the state complexity of Reed}Muller codes. We give a general form of a minimal-span generator matrix
The a-invariant is determined and a description of the defining ideal for the set S K of rational points of the Segre variety over a finite field K is given. The dimension as well as the minimum distance of a Reed-Muller-type linear code defined over S K are also determined. An example is given to i
Berger, T. and P. Charpin, The automorphism group of Generalized Reed-Muller codes, Discrete Mathematics 117 (1993) l-17. We prove that the automorphism group of Generalized Reed-Muller codes is the general linear nonhomogeneous group. The Generalized Reed-Muller codes are introduced by Kasami, Lin
Les codes de Reed-Miiller projectifs sur un corps fini sont des extensions des codes de Reed-Mtiller gCnCralisCs. Nouse donnons les paramttres de ces codes; leur distance minimale est obtenue en utilisant une borne de Serre. On montre qu'en un certain sens, leurs performances sont meilleures que cel