✦ LIBER ✦

A new class of codes meeting the Griesmer bound

✍ Scribed by Helleseth, T.; van Tilborg, H.

Book ID: 114635101
Publisher: IEEE
Year: 1981
Tongue: English
Weight: 1020 KB
Volume: 27
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.1981.1056405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new class of nonbinary codes meeting t

A new class of nonbinary codes meeting the Griesmer bound

✍ Noboru Hamada; Tor Helleseth; Øyvind Ytrehus 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 390 KB

New constructions of codes meeting the G

New constructions of codes meeting the Griesmer bound

✍ Helleseth, T. 📂 Article 📅 1983 🏛 IEEE 🌐 English ⚖ 807 KB

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.

Projective codes meeting the Griesmer bo

Projective codes meeting the Griesmer bound

✍ Tor Hellesth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

## Helleseth, T., Projective codes meeting the Griesmer bound, Discrete Mathematics 106/107 (1992) 265-271. We present a brief survey of projective codes meeting the Griesmer bound. Methods for constructing large families of codes as well as sporadic codes meeting the bound are given. Current res

A characterization of codes meeting the

A characterization of codes meeting the Griesmer bound

✍ Tor Helleseth 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 998 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.