𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Divisors of codes of Reed-Muller type

✍ Scribed by Harold N. Ward


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
856 KB
Volume
131
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Reed-Muller-Type Codes Over the Segre Va
✍ 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

Incidence codes of posets: Eulerian pose
✍ 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

On the covering radius of Reed-Muller co
✍ 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
✍ 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