3.13 Hamming Code
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
For a <strong>Hamming</strong> code of length 2 m - 1 , its parity-check matrix is<br />
a matrix whose columns consist of the entire set of the non-zero<br />
binary m-tuples.<br />
3.14 Golay <strong>Code</strong><br />
<br />
The (23,12) Gloay code is the only known multiple-errorcorrecting<br />
binary perfect code, which is capable of correcting 3<br />
or fewer random errors in a block of 23 digits, d min<br />
= 7 .<br />
(Discovered by Golay in 1949).<br />
<br />
The (23, 12) Gloay code is either generated by<br />
g +<br />
2 4 5 6 10 11<br />
1(<br />
x)<br />
= 1 + x + x + x + x + x x<br />
or by<br />
g +<br />
5 6 7 9 11<br />
2<br />
( x)<br />
= 1 + x + x + x + x + x x<br />
Both g 1<br />
(x)<br />
and g 2<br />
(x)<br />
are factors of x 23 + 1<br />
23<br />
and + 1 = ( 1 + x)<br />
g ( x)<br />
g ( x)<br />
x<br />
1 2