𝔖 Bobbio Scriptorium
✦   LIBER   ✦

New constructions of codes meeting the Griesmer bound

✍ Scribed by Helleseth, T.

Book ID
114635264
Publisher
IEEE
Year
1983
Tongue
English
Weight
807 KB
Volume
29
Category
Article
ISSN
0018-9448

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On codes meeting the Griesmer bound
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

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.