Professional Documents
Culture Documents
Problems
1. The generator matrix (G) of a particular (7, 4) linear block code is given by G
1
= 1
0
1
1
0
1
1
1 1
1 0
1 0
0 0
0
1
0
0
0
0
1
0
0
0
0
1
1
0
1
1
1 1
1 0
1 0
0 0
0
1
0
0
0
0
1
0
= 0000000
= [0001]
= 1100001
= [0010]
= 0110010
= [0011]
= 1010011
= [0100]
= 1010100
= [0101]
= 1100110
= [0110]
= 1100001
= [0111]
= 0000111
= [1000]
= 1111000
= [1001]
= 0011001
= [1010]
= 1001010
= [1011]
= 0101011
= [1100]
= 0101100
= [1101]
= 1001101
0
0
0
1
= 0000000,
= [1110]
= 0011110
= [1111]
= 1111111
= 1100001,
= 0110101,
= 0110010,
= 1100110,
= 1010011,
= 0000111,
= 0011001,
= 1001010,
= 0101011,
= 1001101,
= 0011110,
= 1111111
1
= 1
0
1
1
0
1
1
1
0
1
1
1 1
1 0
1 0
0 0
1
1
1
0
0
1
0
0
1
0
0
0
0
0
1
0
0
1
0
0
Given n = 7, K = 4 where
1 1
= 1 0
0 1
1 1
and
1
= 0
0
0
thus
=[
]=[
0
1
0
0
1
1
1
0
0
0
1
0
0
0
0
1
]
1 0 0
= 0 1 0
0 0 1
1 1 0 1
= 1 0 1 1
1 1 1 0
0
0
1
0
0
0
0
1
0
0
1
= 1010100,
= 1111000,
= 0101100,
1
= 0
0
0 0
1 0
0 1
1
1
1
1
0
1
0 1
1 1
1 0
0 0 1
[1101101] = 1 1 1
1 0 1
0 1 1
1 1 0
= [0 1 0]
.
0
The code vector is not valid
2. The generator matrix (G) of a particular (7, 4) linear block code is given by G
1
= 1
1
1
1
0
1
1
1 1
1 0
1 0
1 0
0
1
0
0
0
0
1
0
0
0
0
1
1
0
1
1
1 1
1 0
1 0
1 0
0
1
0
0
0
0
1
0
= 0000000
= 1110001
= 1110010
0
0
0
1
= [0011]
= [0100]
= [0101]
= [0110]
= [0111]
= [1000]
= [1001]
= [1010]
= [1011]
= [1100]
= [1101]
= [1110]
= [1111]
= 0000011
= 1010100
= 0100101
= 0100110
= 1010111
= 1111000
= 0001001
= 0001010
= 1111011
= 0101100
= 1011101
= 1011110
= 1111111
1
= 1
1
1
1
0
1
1
1
0
1
1
1 1
1 0
1 0
1 0
1
1
1
1
0
1
0
0
1
0
0
0
0
0
1
0
0
1
0
0
Given n = 7, K = 4 where
1 1
= 1 0
1 1
1 1
and
1
= 0
0
0
thus
=[
]=[
0
1
0
0
1
1
1
1
0
0
1
0
0
0
0
1
0
0
1
0
0
0
0
1
0
0
1
1
= 0
0
1
= 1
1
1
1
= 1
1
1 0 0
= 0 1 0
0 0 1
0
1
0
0
0
1
1 1
0 1
1 1
1 1
1 1 1
0 1 1
1 1 1
1 1 1 1
1 0 1 1
1 1 1 1
0 0 1
[1101101] = 1 1 1
1 0 1
1 1 1
1 1 1
= [0 1 1]
.
0
The code vector is not valid
3. The generator matrix (G) of a particular (7, 4) linear block code is given by G
1
= 1
1
1
1
0
1
0
1 1
1 0
1 0
1 0
0
1
0
0
0
0
1
0
0
0
0
1
Solution :
i) List all the code vectors.
Code words.
X = DG
- 8marks
= [0000]
1
1
1
1
= [0000]
1
0
1
0
1 1
1 0
1 0
1 0
= [0000]
= [0001]
= [0010]
= [0011]
= [0100]
= [0101]
= [0110]
= [0111]
= [1000]
= [1001]
= [1010]
= [1011]
= [1100]
= [1101]
= [1110]
= [1111]
0
1
0
0
0
0
1
0
0
0
0
1
= 0000000
= 1010001
= 1110010
= 0100011
= 1010100
= 0000101
= 0100110
= 1110111
= 1111000
= 0101001
= 0001010
= 1011011
= 0101100
= 1111101
= 1011110
= 0001111
- 4marks
1 1 1 1
= 1 0 1 0
1 1 1 0
1 0 1 0
1
= 1
1
1
Given n = 7, K = 4 where
1
0
1
0
1
1
1
1
1
0
0
0
0
1
0
0
0
1
0
0
0
0
1
0
0
0
1
0
0
0
0
1
0
0
1
1
= 1
1
1
1
0
1
0
1
1
1
1
and
1
= 0
0
0
thus
=[
]=[
0
1
0
0
0
0
1
0
0
0
0
1
]
1
= 0
0
1
= 1
1
1
0
1
0
1
0
1
0
1 1
= 1 0
1 1
1 0 0
= 0 1 0
0 0 1
iii) Error detection: `- 4marks
Code vector received r = 1101101
The combination for error detection r.HT = 0
.
1
1
1
0
0
1
1
1
1
1
1
1
1
1
0
1
1
0
1
1 1
1 0
1 1
=0
100
0 1 0
0 0 1
[1101101] = 1 1 1
1 0 1
1 1 1
1 0 1
= [0 0 1]
.
0