The a-invariant of some Reed-Muller Codes
✍ Scribed by C. Rentería; H. Tapia-Recillas
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 68 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0938-1279
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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
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