Griesmer bound

Key takeaways

Griesmer bound belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Griesmer bound to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Griesmer bound from memory before moving on to harder problems.

Reference excerpt

In the mathematics of coding theory, the Griesmer bound, named after James Hugo Griesmer, is a bound on the length of linear binary codes of dimension k and minimum distance d. There is also a very similar version for non-binary codes.

Statement of the bound For a binary linear code, the Griesmer bound is:

n ⩾ ∑ i = 0 k − 1 ⌈ d 2 i ⌉ . {\displaystyle n\geqslant \sum _{i=0}^{k-1}\left\lceil {\frac {d}{2^{i}}}\right\rceil .}

Proof Let N ( k , d ) {\displaystyle N(k,d)} 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

N ( k , d ) ⩾ ∑ i = 0 k − 1 ⌈ d 2 i ⌉ . {\displaystyle N(k,d)\geqslant \sum _{i=0}^{k-1}\left\lceil {\frac {d}{2^{i}}}\right\rceil .}

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.

G = [ 1 … 1 0 … 0 ∗ ∗ ∗ G ′ ] {\displaystyle G={\begin{bmatrix}1&\dots &1&0&\dots &0\\\ast &\ast &\ast &&G'&\\\end{bmatrix}}}

The matrix G ′ {\displaystyle G'} generates a code C ′ {\displaystyle C'} , which is called the residual code of C . {\displaystyle C.} C ′ {\displaystyle C'} obviously has dimension k ′ = k − 1 {\displaystyle k'=k-1} and length n ′ = N ( k , d ) − d . {\displaystyle n'=N(k,d)-d.} C ′ {\displaystyle C'} has a distance d ′ , {\displaystyle d',} but we don't know it. Let u ∈ C ′ {\displaystyle u\in C'} be such that w ( u ) = d ′ {\displaystyle w(u)=d'} . There exists a vector v ∈ F 2 d {\displaystyle v\in \mathbb {F} _{2}^{d}} such that the concatenation ( v | u ) ∈ C . {\displaystyle (v|u)\in C.} Then w ( v ) + w ( u ) = w ( v | u ) ⩾ d . {\displaystyle w(v)+w(u)=w(v|u)\geqslant d.} On the other hand, also ( v | u ) + r ∈ C , {\displaystyle (v|u)+r\in C,} since r ∈ C {\displaystyle r\in C} and C {\displaystyle C} is linear: w ( ( v | u ) + r ) ⩾ d . {\displaystyle w((v|u)+r)\geqslant d.} But

w ( ( v | u ) + r ) = w ( ( ( 1 , ⋯ , 1 ) + v ) | u ) = d − w ( v ) + w ( u ) , {\displaystyle w((v|u)+r)=w(((1,\cdots ,1)+v)|u)=d-w(v)+w(u),}

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Griesmer bound

Start with the simplest possible case. Write down what Griesmer bound claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Griesmer bound before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Griesmer bound ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Griesmer bound

In research: Griesmer bound appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Griesmer bound in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Griesmer bound is common in secondary-school and first-year university syllabi. It links to neighbouring topics Coding theory, so understanding it makes those chapters shorter.
In everyday life: Look for Griesmer bound outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Griesmer bound in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Griesmer bound means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Griesmer bound out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Griesmer bound in simple terms?

In the mathematics of coding theory, the Griesmer bound, named after James Hugo Griesmer, is a bound on the length of linear binary codes of dimension k and minimum distance d. There is also a very similar version for non-binary codes.

Why does Griesmer bound matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Griesmer bound?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Griesmer bound.