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.
β¦ LIBER β¦
On the non-existence of linear codes attaining the Griesmer bound
β Scribed by Tatsuya Maruta
- Publisher
- Springer
- Year
- 1996
- Tongue
- English
- Weight
- 359 KB
- Volume
- 60
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On codes meeting the Griesmer bound
β
Andreas Klein
π
Article
π
2004
π
Elsevier Science
π
English
β 209 KB
On the nonexistence of some quaternary l
β
Noboru Hamada
π
Article
π
1998
π
Elsevier Science
π
English
β 176 KB
It is unknown whether or not there exists a quaternary linear code with parameters [293, 5, 219], [289, 5, 216] or [277, 5, 207]. The purpose of this paper is to prove the nonexistence of quaternary linear codes with parameters [
Divisibility of Codes Meeting the Griesm
β
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.
On linear codes which attain the Solomon
β
Fumikazu Tamari
π
Article
π
1984
π
Elsevier Science
π
English
β 583 KB
A new class of nonbinary codes meeting t
β
Noboru Hamada; Tor Helleseth; Γyvind Ytrehus
π
Article
π
1993
π
Elsevier Science
π
English
β 390 KB
Construction of Some Optimal Ternary Lin
β
N. Hamada; Helleseth T.
π
Article
π
1995
π
Elsevier Science
π
English
β 415 KB