OFFSET
1,1
REFERENCES
Bouyukliev, Iliya; Grassl, Markus; and Varbanov, Zlatko; New bounds for n_4(k,d) and classification of some optimal codes over GF(4). Discrete Math. 281 (2004), no. 1-3, 43-66.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1977, Chap. 17, Section 5.
FORMULA
The Griesmer bound for codes over GF(q) is g_q(k,d) = Sum_{i=0..k-1} ceiling(d/q^i), where k is the dimension and d is the minimal distance.
MAPLE
g:=(q, k, d)->add( ceil(d/q^i), i=0..k-1);
s:=(q, k)->[seq(g(q, k, d), d=1..100)];
s(4, 5);
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 02 2011
STATUS
approved