Algebra

1. Construct GF (24 ) and polynomial representation. Solve the simultaneous equations for
x and y with GF (24 )

x + α5 y + α = α7
x + αy + α7 = α9

2. Solve using GF (3)

x+y+z = 0
2x + y + z = 1
x + 2y + z = 2

3. Given the matrices

 
1 1 0 1 1 0 0
G= 1 1 1 0 0 1 0 
0 1 1 1 0 0 1

 
1 0 0 0 1 1 0
 0 1 0 0 1 1 1 
H=
 0

0 1 0 0 1 1 
0 0 0 1 1 0 1

Show that the row space of G is the null space of H and vice versa

4. Solve for x and y from the following linear equations over GF (24 )

x + α7 y = α2
α12 x + α8 y = α4

5. Solve using GF (3)

x+y+z = 0
2x + y + z = 1
x + 2y + z = 2

m
6. (a) Prove any irreducible polynomial over GF(2) of degree m divides X 2 −1 + 1 with
an example. 6.5 Marks
(b) List the specifications of Reed-Muller code. Obtain all possible code words for
RM (2, 4) 6 Marks

1
 7. Consider a systematic (7, 4) linear block code whose parity matrix P is given by
 
1 1 0
 0 1 1 
P =  1 1 1 


1 0 1
i) Find all possible valid code vectors ii) Draw the corresponding encoding and syndrome
circuit for this code. iii) Determine error detection and correction capabilities for this
code.
8. Define a group and construct modulo 5 addition and multiplication table
9. Define a field and construct modulo 7 multiplication table for GF(7)
10. Check that if X 4 + X + 1 is an irreducible polynomial over GF(2).
11. Check that if X 4 + X + 1 is an primitive polynomial over GF(2).
12. Check that X 3 + X + 1 is a primitive polynomial over GF(2).
13. Define primitive polynomial. Construct a table for GF (23 ) based on the primitive poly-
nomial p(X) = 1 + X + X 3 . List the power, polynomial, and m tuple representations
for each element.
14.
15. Explain and derive the construction of Galois field GF (2m )
16. Construct a table for GF (23 ) based on the primitive polynomial p(X) = 1 + X + X 3 .
Display the power, polynomial, and vector representations of each element.
17. Construct a table for GF (24 ) based on the primitive polynomial p(X) = 1 + X + X 4 .
List the power, polynomial, and m type representation of each element.
Linear Block Codes
1. Consider a systematic (8,4) code whose parity check equations are
v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3

where u0 , u1 , u2 and u3 are message digits, and v0 , v1 , v2 and v3 are parity check dig-
its. Find the generator and parity-check matrices for this code and construct an encoder
circuit. Show analytically that the minimum distance of the code is 4.
2. Consider the (6,3) linear code generated by the following matrix.
 
0 1 1 1 0 0
G= 1 0 1 0 1 0 
1 1 0 0 0 1
Construct the standard array for this code

2
3. Consider a systematic (8,4) code whose parity check equations are
v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3

where u0 , u1 , u2 and u3 are message digits, and v0 , v1 , v2 and v3 are parity check digits.
Find the generator and parity-check matrices for this code and Construct a syndrome
circuit.
4. Consider an (7,4) linear block code whose parity check equations are
v0 = u0 + u2 + u3
v1 = u0 + u1 + u2
v2 = u1 + u2 + u3

where u0 , u1 , u2 and u3 are message digits, and v0 , v1 and v2 are parity check digits.
Construct an encoding and syndrome circuit for this code.
5. Consider a systematic (7,4) linear block code whose parity check equations are
v0 = u0 + u2 + u3
v1 = u0 + u1 + u2
v2 = u1 + u2 + u3

where u0 , u1 , u2 and u3 are message digits, and v0 , v1 and v2 are parity check digits. Find
the generator and parity-check matrices for this code.
6. Consider a systematic (7, 4) linear block code whose parity matrix P is given by
 
1 1 0
 0 1 1 
P =  1 1 1 


1 0 1
i) Find all possible valid code vectors ii) Draw the corresponding encoding circuit iii)
Determine error detection and correction capabilities of code matrices for this code.
7. For a systematic (7, 3) parity matrix P is given by
 
1 1 0
 0 1 1 
P =  1 1 1 


1 0 1
i) Obtain G and H ii)Obtain all possible valid code vectors. iii) Determine error detection
and correction capabilities of code iv)Draw encoder and syndrome calculations circuits.
v)If the sixth bit from the left is in error, find the syndrome.

3
 8. Consider a systematic (7, 4) linear block code whose parity matrix P is given by

9. Consider a systematic (8, 4) with generator matrix G is given by

1 0 0 1 0 0 0 1

i) Obtain G and H ii)Obtain all possible valid code vectors. iii) Find the Hamming dis-
tance and error detection and correction capabilities of code iv)Draw encoder and syn-
drome calculations circuits. v)If the fifth bit from the left is in error in the received
codeword for data string 1101, find the syndrome.

10. Consider a systematic (7, 4) linear block code whose parity matrix P is given by
 
1 1 1
 1 1 0 
P =  1 0 1 


0 1 1

i) Find all possible valid code vectors ii) Draw the corresponding encoding circuit iii)
Detect and correct the following error R = [1 0 1 1 1 0 0]. iv)Draw the syndrome
calculation generation.

11. Consider a systematic (6, 3) linear block code whose generation matrix is
 
1 0 0 1 0 1
G= 0 1 0 1 1 0 
0 0 1 0 1 1

i) Find all possible valid code vectors ii) Draw the corresponding encoding circuit iii)
Detect and correct the following error R = [1 0 1 1 1 0 0]. iv)Draw the syndrome
calculation generation v) Find all the hamming weights and distances.

12. Consider a systematic (8, 4) linear block code whose parity check equations are

v0 = u1 + u2 + u3
v1 = u0 + u1 + u2
v2 = u0 + u1 + u3
v3 = u0 + u2 + u3

where u0 , u1 , u2 and u3 are message digits, and v0 , v1 , v2 and v3 are parity check digits.
i) Find the generator and parity check matrices. ii)Construct a syndrome circuit for this
code.

13. Write a note for the following

(a) Reed Muller Codes.

4
14. For a (7,3) LBC, generate the standard array table. Obtain all possible detectable error
patterns. Identify coset leaders.

15. Mention the Golay decoding steps.

16. List the specifications of Reed-Muller code. Obtain all possible code words for RM (2, 4)
and checksum for a1 2.

17. Mention the parameters of Reed-Muller codes and form the generator matrix of the first
order RM code RM (1, 3) of length 8.

18. Mention the parameters of Reed-Muller codes and form the generator matrix of the sec-
ond order RM code RM (2, 3) of length 8.

19. Mention the parameters of Reed-Muller codes and form the generator matrix of the sec-
ond order RM code RM (4, 2) of length 16.

20. Mention the parameters of Reed-Muller codes and form the generator matrix of the sec-
ond order RM code RM (2, 3) of length 8.

21. Mention the parameters of Reed-Muller codes and form the generator matrix of the sec-
ond order RM code RM (2, 3) of length 8.

22. Write a note on GOLAY codes.

23. List the features of GOLAY codes. Discuss its error detection and corrections capabili-
ties.

24. Design a SEC Hamming code for a message length of 3 bits. Is it a perfect code? Sub-
stantiae your answer.

25. Design a 7 bit SEC Hamming code. How is it shortened Hamming code different from
Hamming codes?