✦ LIBER ✦

On the covering radius of binary, linear codes meeting the Griesmer bound

✍ Scribed by Busschbach, P.; Gerretzen, M.; van Tilborg, H.

Book ID: 114636508
Publisher: IEEE
Year: 1985
Tongue: English
Weight: 439 KB
Volume: 31
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1985.1057073

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On codes meeting the Griesmer bound

✍ Andreas Klein 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 209 KB

We investigate codes meeting the Griesmer bound. The main theorem of this article is the generalization of the nonexistence theorem of Maruta (Des. Codes Cryptography 12 (1997) 83-87) to a larger class of codes.

Do most binary linear codes achieve the

Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)

✍ Delsarte, P.; Piret, P. 📂 Article 📅 1986 🏛 IEEE 🌐 English ⚖ 507 KB

On the nonexistence of some quaternary l

On the nonexistence of some quaternary linear codes meeting the Griesmer bound

✍ Noboru Hamada 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 176 KB

It is unknown whether or not there exists a quaternary linear code with parameters [293, 5, 219], [289, 5, 216] or [277, 5, 207]. The purpose of this paper is to prove the nonexistence of quaternary linear codes with parameters [

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

Divisibility of Codes Meeting the Griesm

Divisibility of Codes Meeting the Griesmer Bound

✍ Harold N. Ward 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 287 KB

We prove that if a linear code over GF( p), p a prime, meets the Griesmer bound, then if p e divides the minimum weight, p e divides all word weights. We present some illustrative applications of this result.

Asymptotic bounds on the covering radius

Asymptotic bounds on the covering radius of binary codes

✍ Sole, P. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 300 KB