Griesmer Bound for Linear Codes over Finite Fields
Let n_q(k,d) be the minimum length for which a linear code of dimension k and minimum Hamming distance d over the field of q elements GF(q) exists. The Griesmer bound gives a lower bound on n_q(k,d), and this database records known values of n_q(k,d).