Scribd
Upload
121 views5 pages

(I) .Generate All Possible Codewords Using The Given Matrix

This document asks a series of questions about a (5,3) linear block code with the given generator matrix. It asks to: (1) generate all codewords; (2) find the parity check matrix; (3) find an equivalent systematic generator matrix; (4) construct the standard array; (5) determine the minimum distance; (6) number of errors it can detect; (7) all error patterns detected; (8) number of errors corrected; (9) symbol error probability compared to uncoded; and (10) if it is a linear code.

Uploaded by

Eyasu Kanbato Otoro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
121 views5 pages

(I) .Generate All Possible Codewords Using The Given Matrix

This document asks a series of questions about a (5,3) linear block code with the given generator matrix. It asks to: (1) generate all codewords; (2) find the parity check matrix; (3) find an equivalent systematic generator matrix; (4) construct the standard array; (5) determine the minimum distance; (6) number of errors it can detect; (7) all error patterns detected; (8) number of errors corrected; (9) symbol error probability compared to uncoded; and (10) if it is a linear code.

Uploaded by

Eyasu Kanbato Otoro
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

3.3 Consider the following generator matrix over GF(2).

(i) .Generate all possible codewords using this matrix.


(ii).Find the parity check matrix, H.
(iii) .Find the generator matrix of an equivalent systematic code.
(iv).Construct the standard array for this code.
(v).What is the minimum distance of this code?
(vi).How many errors can this code detect?
(vii).Write down the set of error patterns this code can detect
(viii).How many errors can this code correct?
(ix). What is the probability of symbol error if we use this encoding scheme?
Compare it with the uncoded probability of error.
(x).Is this a linear code?
(i).Generate all possible codewords using the given matrix
Solution
From the given generator matrix we get that k = 3, n = 5.
G=I . P

[0¿0¿0 ]
[0¿0¿1]
C= [0¿1¿0] ¿
[0¿1¿1]
[1¿ 0¿0]
[1¿0¿1] C 1=¿ 0 0 0 0 0
[1¿1¿ 0] C 2=¿ 0 1 0 1 0
[1¿1¿1] C 3=¿ 1 0 0 1 1
C 4=¿ 1 1 0 0 1
C 5=¿ 1 0 1 0 0
C 6=¿ 1 1 1 1 0
C 7=¿ 0 0 1 1 1
C 8=¿ 0 1 1 0 1
(ii)
Find the parity check matrix, H.
Solution
To find the parity check matrix [H] first we should have get G in systematic form:
Steps to the systematic form of G by Gaussian elimination method
Step-1 Shift C3-----C1, C1---C2, C2------C3 we get the matrix
[1¿1¿0 10 ]
[0¿1¿0 1 1]
[0¿0¿1 0 0]
Step-2 C5---C2, C2---C3, C3---C4, C4-----C5 we get the matrix

[1¿0¿1 0 1]
[0¿1¿1 0 1]
[0¿0¿0 1 0]
Step-3 finally shift c4----c3, c3----c4 we get the matrix that has identity matrix
[1¿ 0¿0] [1¿ 0]
[I]= [0¿1¿0] and parity matrix [P] =[1¿1] the systematic code we get
[0¿0¿1] [0¿1]
[1¿ 0¿0 10 ]
G=[0¿1¿0 11]
[0¿0¿1 0 1]
The parity check matrix[ H ]=[−P T ] I ] where the row and column dimension
reversed
[1¿1¿ 01 0]
[H]=[0¿1¿1 01]
Note:- where c1,c2,c3,c4,c5 are the i columns and R1,R2,R3,R4,R5 are ith row.
th

(iii) .Find the generator matrix of an equivalent systematic code.


Solution
[1¿ 0¿1 00 ]
G=[1¿1¿0 10] is the equivalent generator matrix of a systematic code.
[0¿1¿0 0 1]

(iv).Construct the standard array for this code.


Solution
A standard array for an (n, k) code C is a q n−k∗q k array of all vectors in GF (qn ) in C
(with 0 on the extreme left), and the other rows are the cosets ai+C , each arranged
in corresponding order, with the coset leader on the left.
 The vector having the minimum weight in a coset is called the coset leader.
If there are more than one vector with the minimum weight, one of them is
chosen at random and is declared the coset leader
Steps for constructing a standard array:
(a) in the first row write down all valid code word starting from zeros codewords
(b) Choose a vector a 1>a 1+C as the second row such that a 1+ x is written under
xϵc
(c)Next choose another vector a 2 (not present in the first two rows) the coset a 2+C
as the third row such that a2 + x is written under xϵc
(d) Continue the process until all the cosets are listed and every vector inGF ¿)
appears exactly once. By following the above steps we can construct the standard
arrays and before finding there is predacious criteria is determining coset leader
this done by finding error vector
d* = 2; it can detect 1 error but can’t correct that error d∗¿ s+ 1
where s error syndrome so s=1
H T =[1 0]
[0 1]
[10 ]
[11]
[0 1]
Syndrome= e H T =[0 0 0 0 0¿ [10]
[0 0 0 0 1] [01] [00]
[0 0 0 1 0] [11] [01]
[0 0 1 0 0] [01] = [10]
[0 1 0 0 0] [01]
[1 0 0 0 0] [10]
[11]
[01]
We can choose 4 error patterns with distinct syndrome which can be corrected
using this syndrome table. We can choose coset leader -00100 from below chosen
error pattern
0000 0 → 00
00100 → 01
01000 → 11
10000 → 10
Standard array
00000 01010 10011 11001 10100 11110 00111 01101
00100 01110 10111 11101 10000 11010 00011 01001
01000 00010 11011 10001 11100 10110 01111 00101
10000 11010 00011 01001 00100 01110 10111 11101

gallous field with q-ary number of elements


n
Note: - where GF (q )
(v).What is the minimum distance of this code?

Code words Code weight Code length b/n code words


C 1=¿ 0 0 0 0 0 - 2
C 2=¿ 0 1 0 1 0 2 2
C 3=¿ 1 0 0 1 1 3 3
C 4=¿ 1 1 0 0 1 3 3
C 5=¿ 1 0 1 0 0 2 2
C 6=¿ 1 1 1 1 0 4 4
C 7=¿ 0 0 1 1 1 3 3
C 8=¿ 0 1 1 0 1 3 3

Since the code is linear through all linearity checking criteria so it’s minimum
weight equal to minimum code distance and code weight the number of non-zero
bits on single codeword.
Minimum distance(d*) = 2= (w*) minimum weight
(vi).How many errors can this code detect?
Solution
¿
d =S+1 where s-error syndrome d* = Minimum distance
S=2−1=1 so it can detect one bit error
(vii).Write down the set of error patterns this code can detect
Solution
We have done all things in question (iv) based on that

00001
00010
00100
01000

(viii).How many errors can this code correct?


Solution
¿ d ¿ −1 1
d =2 t+1 where t is error correcting factor then t= = 2 <1 so it
2
cannot correct error
(ix). What is the probability of symbol error if we use this encoding scheme?
Compare it with the uncoded probability of error
Solution
Since it cannot correct any error. The symbol error is same as uncoded probability
of error. However, since 1 bit error can be detected, a request for repeat
transmission can be made on this basis. This scheme will also fail if 2 or more bits
are in error. Thus, if automatic repeat request (ARQ) is used, the probability of
error will be

() 2
2 5
()3
3 2
()4
4
()
p ( e )= 5 p ( 1−p ) + ¿ 5 p ( 1− p ) + 5 p ( 1− p )+ 5 p
5
5

(x).Is this a linear code?


Solution
Since all zero is a valid codeword and sum of any two code words is also a valid
codeword, it is a linear code.

You might also like