✦ LIBER ✦

On the covering radius of Reed—Solomon codes

✍ Scribed by Arne Dür

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 354 KB
Volume: 126
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90256-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Soft-decision decoding of Reed–Solomon c

Soft-decision decoding of Reed–Solomon codes

✍ Hideaki Nara; Hatsukazu Tanaka 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

This paper proposes a new soft-decision decoding procedure for the ReedSolomon code. As the first step, the reliability function for the decoded estimation symbol is defined. To determine the estimated symbol and the reliability efficiently, an open trellis diagram is proposed from which the candida

Decoding of Reed Solomon Codes beyond th

Decoding of Reed Solomon Codes beyond the Error-Correction Bound

✍ Madhu Sudan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 256 KB

On the covering radius of a code and its

On the covering radius of a code and its subcodes

✍ Richard A. Brualdi; Vera S. Pless 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 573 KB

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

Covering Radius of the Reed–Muller CodeR

Covering Radius of the Reed–Muller CodeR(1, 7)—A Simpler Proof

✍ Xiang-dong Hou 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 212 KB

A deep result about the Reed Muller codes, proved by Mykkeltveit in 1980, is that the covering radius of the Reed Muller code R(1, 7) equals 56. We discover an alternative and simpler proof for this important result.