# hamming - Stony Broo University MAT 312/AMS 351 – Fall...

This preview shows pages 1–3. Sign up to view the full content.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Stony Broo University MAT 312/AMS 351 – Fall 2010 Notes on Hamming Codes 1. Error-detecting matrices. Suppose a group code is generated by a matrix G = 1 0 0 0 1 0 0 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 0 0 1 0 0 1 . We can write this matrix as G = ( I 4 | A ) where A is the 4 × 3 matrix encoding the check bits. Let us construct another matrix using A : H = parenleftBigg A I 3 parenrightBigg . In this case, H = 1 0 0 1 1 1 0 1 1 0 0 1 1 0 0 0 1 0 0 0 1 . In general if our code is f : B m → B n , then G is of the form G = ( I m | A ) and H of the form H = parenleftBigg A I n − m parenrightBigg . Remark: The product GH is a 4 × 3 (in general, m × ( n − m )) matrix of zeroes. What happens is that during the multiplication each element in A gets added to itself, giving 0. Schematically GH = ( I m | A ) · parenleftBigg A I n − m parenrightBigg = I m A + AI n − m = A + A = 1 where here represents the m × ( n − m ) matrix of zeroes. This means that H , applied on the right to any one of the code-words, must give the length n − m 0-vector: (0 ,..., 0), since a code-word is of the form wG for some w ∈ B m , and ( wG ) H...
View Full Document

{[ snackBarMessage ]}

### Page1 / 4

hamming - Stony Broo University MAT 312/AMS 351 – Fall...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online