๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Achievement of the Griesmer Bound

โœ Scribed by Tatsuya Maruta

Book ID
110260786
Publisher
Springer
Year
1997
Tongue
English
Weight
63 KB
Volume
12
Category
Article
ISSN
0925-1022

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.