A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound |
scientific article; zbMATH DE number 219087
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound |
scientific article; zbMATH DE number 219087 |
Statements
A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (English)
0 references
13 September 1993
0 references
\(q\)-ary linear code
0 references
minimum distance
0 references
Griesmer's bound
0 references
optimal linear codes
0 references
linear programming
0 references
maxhypers
0 references
minihypers
0 references
0 references
0 references
