Let
View
and furthermore define
with
Reed-Muller Linear Code
is the vector subspace of
Example
| 000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 | |
|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | |
| 1 | 1 | 1 | 1 | 0 | 0 | 0 | 0 | |
| 1 | 1 | 0 | 0 | 1 | 1 | 0 | 0 | |
| 1 | 0 | 1 | 0 | 1 | 0 | 1 | 0 | |
| 1 | 1 | 0 | 0 | 0 | 0 | 0 | 0 | |
| 1 | 0 | 0 | 0 | 1 | 0 | 0 | 0 | |
| 1 | 0 | 1 | 0 | 0 | 0 | 0 | 0 | |
| 1 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
Deleting the first component of each codeword gives Hamming’s Original Code
Lemma
The vector
Proof
We have a set of
So it suffices to show they span
Let
Let
and
Expanding using distributive law, gives that
But these clearly span
Corollary
Lemma
Proof
We order
(where we take
and
Let
It is a sum of wedge products of
so
Where
We have
So
Corollary
Proof
If