| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650285 | Discrete Mathematics | 2007 | 9 Pages |
Abstract
We use our results to identify a class of parameters for linear codes for which the Griesmer bound is not sharp. Our theorem generalizes the non-existence results from Maruta [On the achievement of the Griesmer bound, Des. Codes Cryptogr. 12 (1997) 83-87] and Klein [On codes meeting the Griesmer bound, Discrete Math. 274 (2004) 289-297].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andreas Klein, Klaus Metsch,