✦ LIBER ✦

Comments on "On the covering radius of codes" [with reply]

✍ Scribed by Bhandari, M.C.; Garg, M.S.; Graham, R.L.; Sloane, N.J.A.

Book ID: 114540520
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 185 KB
Volume: 36
Category: Article
ISSN: 0018-9448
DOI: 10.1109/18.53766

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

More on the covering radius of BCH codes

✍ Levy-dit-Vehel, F.; Litsyn, S. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 428 KB

Bounds on the Covering Radius of Linear

Bounds on the Covering Radius of Linear Codes

✍ A. Ashikhmin; A. Barg 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 86 KB

On the covering radius of Reed—Solomon c

On the covering radius of Reed—Solomon codes

✍ Arne Dür 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 354 KB

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

On the covering radius of binary codes (

On the covering radius of binary codes (Corresp.)

✍ Helleseth, T.; Klove, T.; Mykkeltveit, J. 📂 Article 📅 1978 🏛 IEEE 🌐 English ⚖ 257 KB

On the covering radius of cyclic linear

On the covering radius of cyclic linear codes and arithmetic codes

✍ Tor Helleseth 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC