Professional Documents
Culture Documents
Block Codes
2/2/2014
Theorem
For any k x n matrix G over F2, with k linearly independent rows, there exists an (n-k) x n matrix over the same field with (n-k) linearly independent rows such that for any row gi in G and any hj in H, gi.hj = 0. The row space of G is the null space of H and vice versa.
2/2/2014
Contd.
Any k linearly independent code words of a (n,k) linear code can be used to form a generator matrix for the code. C is a subspace (called Code Space) and it has an orthogonal complement C which is also a subspace. If u C, and v C , then uTv = 0. C can be used as a code called dual code of C (n,n-k code).
2/2/2014
Contd.
Dimension of C is n-k ( n-k basis vectors). Let H be a matrix with these basis vectors as rows. Any n-tuple c is a code word iff it is orthogonal to every row vector of H. Hence, CHT = 0 and GHT = 0
H is called the parity check matrix of C.
2/2/2014
2/2/2014
Systematic code
G=[ Ik P] or [ P Ik] Since GHT = 0; H=[PT In-k] Generator matrix of a linear block code C will be the parity check matrix of the equivalent dual code and vice-versa.
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
2/2/2014
So an error is detected
2/2/2014