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:
“People named John and Mary never divorce. For better or for worse, in madness and in saneness, they seem bound together for eternity by their rudimentary nomenclature. They may loathe and despise one another, quarrel, weep, and commit mayhem, but they are not free to divorce. Tom, Dick, and Harry can go to Reno on a whim, but nothing short of death can separate John and Mary.”
—John Cheever (1912–1982)