In the mathematics of coding theory, the Griesmer bound, named after James Hugo Griesmer, is a bound on the length of binarycodes of dimension k and minimum distance d. There is also a very similar version for non-binary codes.
Let denote the minimum length of a binary code of dimension k and distance d. Let C be such a code. We want to show that
Let G be a generator matrix of C. We can always suppose that the first row of G is of the form r = (1, ..., 1, 0, ..., 0) with weight d.
The matrix generates a code , which is called the residual code of has obviously dimension and length has a distance but we don't know it. Let be such that . There exists a vector such that the concatenation Then On the other hand, also since and is linear: But
so this becomes . By summing this with we obtain . But so we get This implies
therefore due to the integrality of
By induction over k we will eventually get
Note that at any step the dimension decreases by 1 and the distance is halved, and we use the identity