𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial problems for binary Reed-Muller codes

✍ Scribed by D. A. Nudel'man

Publisher
Springer US
Year
1975
Tongue
English
Weight
408 KB
Volume
10
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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. (~

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