𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The parameters of projective Reed–Müller codes

✍ Scribed by Gilles Lachaud

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
257 KB
Volume
81
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 celles des codes de Reed-Mtiller usuels.

The projective Reed-Mtiller codes on a finite field are extensions of the classical generalized Reed-Mtiller codes. We give the parameters of these codes; we use a bound given by Serre in order to get their minimal distance. We show that in some sense their performances are better than those of the classical Reed-Miiller codes.

📜 SIMILAR VOLUMES

On the Reed-Muller codes
On the Reed-Muller codes
✍ E.F. Assmus Jr 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 632 KB

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 R

On the covering radius of Reed-Muller co
On the covering radius of Reed-Muller codes
✍ Gérard D. Cohen; Simon N. Litsyn 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 371 KB

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

The automorphism group of Generalized Re
The automorphism group of Generalized Reed-Muller codes
✍ Thierry Berger; Pascale Charpin 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1008 KB

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

Incidence codes of posets: Eulerian pose
Incidence codes of posets: Eulerian posets and Reed-Muller codes
✍ Kenneth P. Bogart 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 713 KB

This paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. In the case that the partial:; ordered set is Eulertan the length of the code is the number of elements in the poset, the dimension is the size of a sePected order ideal and the minimum distance is the minimu

Reed-Muller-Type Codes Over the Segre Va
Reed-Muller-Type Codes Over the Segre Variety
✍ M. González-Sarabia; C. Renterı́a; H. Tapia-Recillas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 124 KB

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