In the mathematics of coding theory, the Griesmer bound, named after James Hugo Griesmer, is a bound on the length of binary codes of dimension k and minimum distance d. There is also a very similar version for non-binary codes.
Read more about Griesmer Bound: Statement of The Bound, Proof, The Bound For The General Case, See Also
Famous quotes containing the word bound:
“Aunt,
you know that Tree of Love,
its roots bound in long affection
and tended with respect?
No one heard it falling.”
—Hla Stavhana (c. 50 A.D.)