✦ LIBER ✦

On Berman's characterization of the Reed-Muller codes

✍ Scribed by E.F. Assmus Jr.

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 358 KB
Volume: 56
Category: Article
ISSN: 0378-3758
DOI: 10.1016/s0378-3758(96)00004-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Further results on the covering radii of

Further results on the covering radii of the Reed-Muller codes

✍ Xiang-Dong Hou 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 434 KB

Orphan structure of the first-order Reed

Orphan structure of the first-order Reed-Muller codes

✍ Richard A. Brualdi; Ning Cai; Vera S. Pless 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Some inequalities about the covering rad

Some inequalities about the covering radius of Reed-Muller codes

✍ Xiang-Dong Hou 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 312 KB

Let R(r, m) be the rth order Reed-Muller code of length 2 '~, and let p(r, m) be its covering radius. We prove that if 2 \_< k -< m -r -1, then p(r + k, m + k) > #(r, m) + 2(k -1). We also prove that if m -r > 4, 2 < k < m -r -1, and R(r, m) has a coset with minimal weight pfr, m) which does not co