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:
“Without being bound to the fulfillment of promises, we would never be able to keep our identities; we would be condemned to wander helplessly and without direction in the darkness of each man’s lonely heart, caught in its contradictions and equivocalities—a darkness which only the light shed over the public realm through the presence of others, who confirm the identity between the one who promises and the one who fulfills, can dispel.”
—Hannah Arendt (1906–1975)