𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions

✍ Scribed by Borissov, Y.; Braeken, A.; Nikova, S.; Preneel, B.


Book ID
114638699
Publisher
IEEE
Year
2005
Tongue
English
Weight
347 KB
Volume
51
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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