Scribd
Upload
24 views20 pages

Lecture 4

This document discusses linear block codes. It states that for any k x n matrix G over F2 with k linearly independent rows, there exists an (n-k) x n matrix H over the same field with (n-k) linearly independent rows such that the row space of G is the null space of H and vice versa. It also explains that a linear block code of length n and 2k codewords forms a k-dimensional linear subspace, and that the k rows of the generator matrix G must be linearly independent. Additionally, it describes that the parity check matrix H has n-k rows that form the basis for the dual code space which is orthogonal to the code space.

Uploaded by

mailstonaik
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
24 views20 pages

Lecture 4

This document discusses linear block codes. It states that for any k x n matrix G over F2 with k linearly independent rows, there exists an (n-k) x n matrix H over the same field with (n-k) linearly independent rows such that the row space of G is the null space of H and vice versa. It also explains that a linear block code of length n and 2k codewords forms a k-dimensional linear subspace, and that the k rows of the generator matrix G must be linearly independent. Additionally, it describes that the parity check matrix H has n-k rows that form the basis for the dual code space which is orthogonal to the code space.

Uploaded by

mailstonaik
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 20

Lecture 4

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

Linear Block Codes-contd


A block code C of length n and 2k codewords is linear block code iff C forms a k-dimensional linear subspace over a vector space of dimension n. No. of linearly independent vectors required to generate a k dimensional subspace consisting of 2k code words is k and this set is a basis for the sub space. The block encoding process is c=mG.Hence the code words are linear combination of the k rows of G.Hence the k rows of G must be linearly 2/2/2014 independent.

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

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy