✦ LIBER ✦

Orphan structure of the first-order Reed-Muller codes

✍ Scribed by Richard A. Brualdi; Ning Cai; Vera S. Pless

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 563 KB
Volume: 102
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90118-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The parameters of projective Reed–Müller

The parameters of projective Reed–Müller codes

✍ Gilles Lachaud 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 257 KB

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

Classification of cosets of the Reed-Mul

Classification of cosets of the Reed-Muller code R(m−3,m)

✍ Xiang-dong Hou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 922 KB

Using genetic algorithms for the variabl

Using genetic algorithms for the variable ordering of Reed-Muller binary decision diagrams

✍ A.E.A Almaini; N Zhuang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 604 KB

Structural completeness of the first-ord

Structural completeness of the first-order predicate calculus

✍ W. A. Pogorzelski; T. Prucnal 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB

1. The problem of structural conipleteness of a logical system is formulated as the qiicstion about derivability in this system of all permissible and structural rules (cf. [lo]).