𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Linear inequalities for covering codes. I. Pair covering inequalities

✍ Scribed by Zhang, Z.

Book ID
114541449
Publisher
IEEE
Year
1991
Tongue
English
Weight
833 KB
Volume
37
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Inequalities for Code Pairs
Inequalities for Code Pairs
✍ Ahlswede, Rudolf; MΓΆrs, Michael πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 405 KB