𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on Reed-Muller codes

✍ Scribed by Bal Kishan Dass; Sunil Kumar Muttoo

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
294 KB
Volume
2
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ 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 Trellis Structures for Reed–Muller Co
On Trellis Structures for Reed–Muller Codes
✍ Tim Blackmore; Graham H. Norton πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 254 KB

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

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

On binary k-paving matroids and Reed-Mul
On binary k-paving matroids and Reed-Muller codes
✍ Sanjay Rajpal πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 487 KB

A matroid Jr' of rank r>.k is k-paving if all of its circuits have cardinality exceeding r-k. In this paper, we develop some basic results concerning k-paving matroids and their connections with codes. Also, we determine all binary 2-paving matroids. (~