✦ LIBER ✦

A characterization of codes meeting the Griesmer bound

✍ Scribed by Tor Helleseth

Book ID: 114037550
Publisher: Elsevier Science
Year: 1981
Weight: 998 KB
Volume: 50
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(81)90184-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A survey of recent works with respect to

A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min·hyper in a finite projective geometry

✍ Noboru Hamada; Michel Deza 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 810 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 some {3vμ + 1, 3vμ

A characterization of some {3vμ + 1, 3vμ; k - 1, q}-minihypers and some [n, k, qk-1 - 3qμ; q]-codes (k ⩾ 3, q ⩾ 5, 1 ⩽ μ < k - 1) meeting the Griesmer bound

✍ Noboru Hamada; Tor Helleseth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

For any In, k, d; q]-code the Griesmer bound says that n >t ~ F d/q' 7. The purpose of this paper is to characterize all In, k, qk-1 \_ 3q~; q]-codes meeting the Griesmer bound in the case where k >/3, q >~ 5 and 1 ~</~ < k -1. It is shown that all such codes have a generator matrix whose columns co

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.

A characterization of some {2υα+1+υγ+1,

A characterization of some {2υα+1+υγ+1, 2υα+υγ; k−1, 3}- minihypers and some (n,k, 3k−1 − 2 · 3α − 3γ; 3)-codes (k⩾3, 0⩽α<γ<k−1) meeting the Griesmer bound

✍ Noboru Hamada; Tor Helleseth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1023 KB