USN 203EC001

Ph.D./M.S. (Engg.) by Research Degree Examination, Aug./Sep. 2023

Error Control Coding

Time: 3 hrs. Max. Marks: 100

Note: Answer any FIVE full questions, choosing ONE full question from each module.

Module-1
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

1 a. Define Mutual Information. Derive and explain the properties of Mutual Information.
(10 Marks)
b. A DMS has alphabet of five symbols with their probabilities as given below:
Symbol S0 S1 S2 S3 S4
Probabilities 0.4 0.2 0.2 0.1 0.1
Compute Huffman code by placing composite symbols as high as possible and by placing
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

composite symbol as low as possible. Also find the:

(i) The average code word length
(ii) The variance of the average code word for both cases (10 Marks)

OR
2 a. Define the following terms and also state their properties:
(i) Group (ii) Field (08 Marks)
b. Construct the group under modulo-6 addition and modulo-3 multiplication. (06 Marks)
c. Construct a table for GF(23) based on the primitive polynomial P(X) = 1 + X + X3. Display
the power, polynomial and vector representations of each element. Determine the order of
each element. (06 Marks)

Module-2
3 a. Consider a systematic (8, 4) code whose parity check equations are
v 0  u1  u 2  u 3 ; v1  u 0  u1  u 2 ; v 2  u 0  u1  u 3 ; v 3  u 0  u 2  u 3
where u0, u1, u2, u3 are message digits and v0, v1, v2, v3 are parity check digits. Find the
generator and parity check matrices for this code. Show analytically that the minimum
distance of this code is 4.
(i) Construct the encoder circuit
(ii) Construct the syndrome circuit (10 Marks)
b. Consider (n, k) linear cyclic code with generator matrix G and parity check matrix H.
(i) Let v = (v0, v1, …..vn – 1) be a code word that was transmitted over a noisy channel.
(ii) Let r = (r0, r1, …. rn – 1) be the received vector at the output of the channel.
Show that syndrome s is simply the vector sum of received parity digits (r0, r1, r2,….rn – k – 1)
and the parity check digits. (10 Marks)

OR
4 a. The parity check digits of (7, 4) Hamming code are generated by
c5  d1  d 3  d 4 ; c6  d1  d 2  d 3 ; c7  d 2  d 3  d 4
(i) Find the generator matrix [G] and parity check matrix [H] for this code.
(ii) Prove that GH7 = 0.
(iii) The (n, k) linear block code so obtained has a dual code. This dual code is a (n, n – k)
code having a generator matrix H and a parity check matrix G. Determine the eight
code vector of the dual code for the (7, 4) Hamming code described above.
(iv) Find the minimum distance of the dual code determined in part (iii) (12 Marks)
1 of 3
 203EC001
b. Let c be an (n, k) linear code with parity check matrix H. For each code vector of Hamming
weight l, there exist l columns of H such that the vector sum of these l columns is equal to
zero vector. Prove that, if there exist l columns of H whose vector sum is that zeros vector,
there exists a code vector of Hamming weight l in c. (08 Marks)

Module-3
5 a. (i) Prove that the generator polynomial g(x) of an (n, k) cyclic code is a factor of xn + 1.
(ii) Prove that if g(x) is a polynomial of degree (n – k) and is a factor of xn + 1, then g(x)
generates an (n, k) cyclic code. (08 Marks)
b. (i) Explain encoding circuit for an (n, k) cyclic code with generator polynomial g(x).
(ii) Explain encoding circuit for an (n, k) cyclic code with parity polynomial h(x).
(12 Marks)

OR
6 a. Explain cyclic Hamming code. Also with circuit diagram, explain the decoder for a cyclic
Hamming code. (10 Marks)
b. For a (7, 4) cyclic code generated by generator polynomial g ( x )  1  x  x .
3

(i) Obtain the code polynomial and code vector for the message polynomial U(x) = 1 + x3.
(ii) Compute generator matrix G in non systematic and systematic form.
(iii) Obtain parity check polynomial
(iv) Construct encoder based on generator polynomial g(x). Suppose that the message
u = (1011) is to be encoded, determine the content of shift register and compute code
vector and code polynomial.
(v) Construct encoder based on parity polynomial. Suppose that the message U = (1011) is
to be encoded, determine its corresponding code vector and code polynomial.
(10 Marks)

Module-4
7 a. Explain the iterative algorithms for finding the error location polynomial (x) in BCH
codes. (08 Marks)
b. With an appropriate diagram, explain general type I one step majority logic decoder.
(12 Marks)

OR
8 a. Prove that t – error correcting BCH code indeed has a minimum distance of atleast (2t + 1).
(10 Marks)
b. With necessary diagram:
(i) Explain Galois Field GF(24) adder
(ii) Explain circuit for multiplying arbitary element in GF(24) by 23. (10 Marks)

Module-5
9 a. In a (2, 1, 3) convolution encoder, the impulse response is given by g(1) = (1 0 1 1),
g(2) = (1 1 1 1).
(i) Draw the encoder circuit.
(ii) For the information sequence U = (1 0 1 1 1), obtain the output sequence and code
word. (10 Marks)
b. Explain encoding of convolution codes:
(i) Denote the representation of code word for transmission over the channel.
(ii) Obtain the representation of generator matrix G. (10 Marks)

2 of 3
 203EC001

OR
10 a. Consider (3, 2, 2) systematic code with transfer function matrix
1 0 1  D  D 2 
G (D)   
0 1 1  D 2 
(i) Draw the straight forward realization of encoder.
(ii) Draw the alternate realization of encoder. (10 Marks)
b. Consider (3, 2, 1) convolution encoder the impulse response is given by
g1(1) = (1 1), g1( 2 ) = (0 1), g1( 3) = (1 1)
g (21) = (0 1), g (22 ) = (1 0), g (23) = (1 0)
(i) Draw the binary convolution encoder circuit.
(ii) For the message U(1) = (1 0 1) and U(2) = (1 1 0).
Find the code word using time domain and transform domain approach. (10 Marks)

*****

3 of 3
 USN 203EC001

Ph.D./M.S. (Engg.) by Research Degree Examination, December 2022

Error Control Coding

Time: 3 hrs. Max. Marks: 100

Note: Answer any FIVE full questions, choosing ONE full question from each module.
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

Module-1
1 a. A code is composed of dots and dashes. Assuming that a dash is 3 times as long as a dot and
has one-third the probability of occurrence. Calculate:
i) The information in a dot and dash.
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

ii) The entropy of dot-dash code.

iii) The entropy rate of information, if a dot lasts for 10ms and this time is allowed
between symbols. (10 Marks)
n
b. Prove that entropy of zero memory extension source is given by H(s ) = n.H(s). (10 Marks)

OR
2 a. State and explain the properties of mutual information. (10 Marks)
b. A source transmits two independent messages with the probabilities of P and (1-P)
respectively. Prove that entropy is maximum when both the messages are equally likely. Plot
the variation of entropy (H) as a function of probability ‘P’ of the messages. (10 Marks)

Module-2
3 a. The parity check bits of a (8, 4) block code are generated by c s = d1 + d2 + d4, C6 = d1 + d2 +
d3, c7 = d1 + d3 + d4, c8 = d2 + d3 + d4.
i) Find the [G] and [H] for this code.
ii) Find the minimum weight.
iii) Show that it is capable of correcting all single errors and capable of detecting all
double errors by preparing syndrome table for them. (10 Marks)

b. For a systematic (7, 4) linear block code whose generator matrix is given below. Find all the
code words.
 | 
1 0 0 0 | 1 0 1
 
0 1 0 0 | 1 1 1
 | 
G 
0 0 1 0 | 1 1 0
 | 
 | 
0 0 0 1 0 1 1
 | 
(10 Marks)

1 of 3
 203EC001

OR
4 a. Consider a(6, 3) linear block code whose parity matrix is given below:
1 0 1
P  0 1 1
1 1 0
i) Find all the codeword’s for this code.
ii) Minimum weight of the code.
iii) Hamming distance. (10 Marks)
 
b. For a (5, 2) LBC, the generator matrix is of the form  IK | P where P is given by
 | 
1 1 1
[P]    . Find: i) Generator matrix ii) Parity check matrix iii) All possible valid
1 1 0
code-vectors iv) dmin and error correcting capability of the code v) Construct standard
array by listing all the 32 five-tuple patterns. (10 Marks)

Module-3
5 a. State and explain the properties of Binary cyclic codes. (10 Marks)
b. For the (7, 4) single error correcting cyclic code, D(x) = d0 + d1 x + d2 x + d3x3 and
2

xn + 1 = x7 + 1 = (1 + x + x3) (1 + x + x2 + x4). Using the generator polynomial

g(x) = 1 + x + x3. Find all the 16 code-vectors of the cyclic code both in non-systematic and
systematic form. (10 Marks)

OR
6 a. Find the cyclic codes in both systematic and non-systematic format for the following data
vectors: i) [D1] = 1100 ii) [D2] = 1111 given g(x) = 1 + x + x3 and it is a (7, 4) cyclic
code. (10 Marks)
b. Design an encoder circuit for the (7, 4) binary cyclic code generated by g(x) = 1 + x + x3 and
verify its operation using the message vectors (1001) and (1011). (10 Marks)

Module-4
7 a. Consider a (15, 11) cyclic code generated by g(x) = 1 + x + x4. Devise a feedback shift
register encoder circuit, use the encoding procedure with the message vector 10010110111
by listing the state of the registers. (10 Marks)
b. A (15, 5) linear cyclic code has a generator polynomial g(x) = 1 + x + x + x + x + x8 + x10
2 4 5

i) Draw the block diagram of an encoder and syndrome calculator for this code.
ii) Find the code polynomial for the message polynomial D(x) = 1 + x2 + x4 in systematic
form.
iii) Is V(x) = 1 + x4 + x6 + x8 + x14 a code polynomial. (10 Marks)

OR
8 a. A linear hamming code is described by a generator polynomial g(D) = 1 + D + D3
i) Determine the generator matrix G and parity check matrix.
ii) Design an encoder circuit. (10 Marks)
b. Write a note on BCH codes. (10 Marks)

2 of 3
 203EC001

Module-5
9 a. For the convolution encoder shown in the Fig.Q.9(a) below, the information sequence is
d = 10011. Find the output sequence using the following two approaches:
i) Time domain approach.
ii) Transfer domain approach. (10 Marks)

Fig.Q.9(a)
(1) (2) (3)
b. Consider a (3, 1, 2) convolution encoder with g = 110, g = 101 and g = 111.
i) Draw the encoder diagram.
ii) Find the codeword for message sequence (11101) using generator matrix and transfer
domain approach. (10 Marks)

OR
1
10 a. Consider the rate r  and constraint length K = 2 convolution encoder shown in the
2
Fig.Q.10(a) below:

Fig.Q.10(a)
i) Draw the state diagram.
ii) Draw the code tree.
iii) Draw Trellis diagram.
iv) Trace the path through the tree that corresponds to the message sequence {1, 0, 1}.
(10 Marks)
b. Explain Viterbi decoding. (10 Marks)

*****

3 of 3
 20ECS23

pm
USN

Second Semester M.Tech. Degree Examination, July/August 2022

6
:1
Error Control Coding

5
Time: 3 hrs. Max. Marks: 100

:1
Note: Answer any FIVE full questions, choosing ONE full question from each module.

01

C
Module-1
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

-V
1 a. Obtain an expression for entropy of a zero memory information source emitting independent

2
sequence of symbols and discuss the various properties of entropy. (10 Marks)

02

C
b. Define Binary symmetric channel and obtain the expression for its channel capacity.
(10 Marks)

-V
-2 OR
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

C
10
2 a. Define Mutual information. Derive and explain the properties of mutual information.

-V
(10 Marks)
b. Define a field and modulo 5 addition and multiplication table for GF (2).
2-

(05 Marks)
c. Let V be a vector space over a field F. Prove that for any c in F and any ν in V,
C
-1

(-c). ν = c.(- ν) = -(c. ν). (05 Marks)

-V
U

Module-2
VT

3 a. Write a note on product coder and inter leaved codes. (10 Marks)
C

m
b. Form the generator matrix of the first order RM code RM (1, 3) of length 8. What is the
-V

0p
minimum distance of the code? Determine its parity check sums and devise majority-logic
ecoder for the code. Decode the received vector r = (01000101) (10 Marks)

C
C

:4

-V
-V

OR
34

4 a. For a systematic (7, 4) linear block code, the parity matrix P is given by
C

1 1 1
C

-V

1 1 0
01
-V

P 
1 0 1
C

 
22
C

0 1 1
-V
-V

i) Find all possible code vectors

20

ii) Draw the corresponding encoding circuit

C

iii) Detect and correct the following error R = [1011100]

VC

0-

-V

iv) Draw the syndrome calculation circuit (14 Marks)

b. If C = DG is a valid vector prove that CHT = 0 where HT is transpose of parity check matrix
-1

H. (06 Marks)
C
12

-V

Module-3
5 a. A (15, 5) linear cyclic code has a generator polynomial
g(x) = 1 + x + x2 + x4 + x5 + x8 + x10.
C

i) Draw the block diagram of an encoder and syndrome calculator for this code
-V

ii) Find the code polynomial for the message polynomial D(x) = 1 + x2 + x4 in systematic
form
C

iii) Is v(x) = 1 + x4 + x6 + x8 + x14 a code polynomial? (10 Marks)

-V

3
b. A linear Hamming code is described by a generator polynomial g(D) = 1 + D + D .
i) Determine the generator matrix G and parity check matrix
ii) Design an encoder circuit. (10 Marks)
C

1 of 2
-V
VC
 20ECS23

6 pm
OR
6 a. With a block diagram, explain decoding circuit for (31, 26) cyclic hamming code generated

:1
by g(x) = 1 + x2 + x5. If the above hamming code is shortened by three digit. Draw and

5
explain the decoding circuit for resultant (28, 23) shortened cyclic code. (10 Marks)

:1
b. With a block diagram, explain the decoding operation of error trapping decodes for a (15, 7)
cyclic code generated by g(x) = 1 + x4 + x6 + x7 + x8. (10 Marks)

01

C
-V
2
Module-4
a. Give the circuit for Galois field (2 ) adder and multiplier for multiplying GF(24) by 3 and
4

02

C
7

-V
explain their operation. What is requirement of these circuits? (10 Marks)
-2
b. Give the important parameter and features of RS Code. Give the encoding circuit for
r-ary RS code and explain the symbol used in the circuit. (10 Marks)

C
10

-V
2-

OR
8 a. Example with suitable diagram type – 1 one step majority logic decoder error correction
C
-1

procedure. (10 Marks)

-V
U

b. Determine the parameter of a q-ary RS Code over hF (16) for dmin = 9. Also find the total
number of code-words in the code and also the nearest neighbour for any codeword at a
VT

distance of dmin = 9.
m (10 Marks)
-V

0p

C
Module-5
C

:4

9 -V
a. Consider the (3, 1, 2) convolution code with g(1) = (110), g(2) = (101) and g(3) = (111)
-V

i) Draw the encoder block diagram

34

ii) Find the generator matrix

C
C

iii) Find the codeword corresponding to the information sequence (11101) using time
:

-V
01
-V

domain and transform domain approach. (10 Marks)

b. Explain the steps involved in viterbi algorithm with an example. (10 Marks)
C
22
C

-V
-V

OR
20

10 a. Consider the convolution encoder with g(x) = (1 + x, 1 + x2, 1 + x + x2). If the received
C

sequence ν = [110, 110, 110, 111, 010, 101, 101]. Using Viterbi algorithms find the
VC

0-

-V

transmitted sequence. Assume that the codeword is transmitted over BSC channel. (10 Marks)
b. For a rate ½ convolution encoder with a transfer function G(x) = [ 1 + x2 + x3, 1 + x + x2 +
-1

x3]. Draw the encoder and state diagram, hence evaluate the code the codeword produced by
C
12

the I/P sequence 10111. (10 Marks)

-V
C

*****
-V
C
-V

2 of 2
C
-V
VC
 pm
18ECS/ELD23

9
USN

:1
Second Semester M.Tech. Degree Examination, Aug./Sept.2020

7
Error Control Coding

:1
01

C
Time: 3 hrs. Max. Marks: 100

-V
Note: Answer any FIVE full questions, choosing ONE full question from each module.

0
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

Module-1

02

C
1 a. Define Entropy of a source and show that

-V
k 1-2  1 
H (s)   p k log 2  
 pk 

C
08
k0

where S = {s0, s1, s2, ….s k-1} and P = {p0, p1, p2, …..p k – 1}. (06 Marks)

-V
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

b. Determine the entropy of the second extension of the source. With source alphabets
1-

(2)
S = {s0, s1, s2} with the respective probabilities P = {¼, ¼, ½} and show that H(s ) = 2H(s).
C
-3

(08 Marks)
-V
c. Define field and the basic properties of fields. (06 Marks)
U

OR
VT

2 a. Discuss the Shannon’s source coding theorem.

m (06 Marks)
-V

b. Show that the channel capacity of a binary symmetric channel is given by C = 1 – H(p)
8p
where ‘p’ represents the conditional probability of error. (06 Marks)

C
c. Construct the modulo – 7 addition and multiplication tables for GF(7). (08 Marks)
C

:5

-V
-V

Module-2
34

3 a. The parity matrix P for a systematic (7, 4) linear block code is given by
C
C

1 1 0 
:

-V
01

 
-V

 0 1 1
P
1 1 1 
C

 
20
C

-V

1 0 1 
-V

(i) Find all possible code vectors.

20

(ii) Draw the encoding circuit.

C
VC

(iii) Detect and correct error in  = (1001001) (14 Marks)

8-

-V

b. Write the general decoder for a linear block code and explain the error correcting procedure.
-0

(06 Marks)
C

OR
31

-V

4 a. Define Hamming weight, Hamming distance and minimum distance of code vectors with
examples. (06 Marks)
b. Write the G and H matrices for the single parity check code and repetition code. (04 Marks)
C

c. Discuss the parameters of Hamming codes. Construct the H matrix for (7, 4) Hamming
-V

code. Also obtain the shortened Hamming code and show that the minimum distance is 4.
(10 Marks)
C

Module-3
-V

5 a. Construct the generator matrix and parity check matrix for a (7, 4) cyclic code given by
g(x) = 1 + x + x3 in both systematic and non systematic form. (10 Marks)
b. With a neat block diagram, explain the working of general cyclic decoder (Meggitt
C

Decoder). (10 Marks)

-V

1 of 2
VC
 pm
18ECS/ELD23
OR

9
6 a. Construct a (7, 4) cyclic encoder with g(x) = 1 + x + x3 suppose the message u = (1011),

:1
determine the complete code word and the code polynomial. Show the register contents
when each of the data bits is shifted into the encoder.

7
(10 Marks)
b. Explain the principle of operation of a complete decoding circuit for a cyclic Hamming code

:1
in steps. (10 Marks)

01

C
-V
Module-4
7 a. Let  be a primitive element of the GF(24) such that 1 +  + 4 = 0. Determine the generator

0
polynomial for the double error and triple error correcting BCH code. (10 Marks)

02

C
b. Device a circuit to multiply an arbitrary element β of GF (24) by the element 3, where  is

-V
the primitive element with minimal polynomial (x) = 1 + x + x4.
-2 (10 Marks)

OR

C
08

8 a. With a neat block diagram, explain the principle of operation of general type-I one step

-V
majority logic decoder. (10 Marks)
1-

b. Draw the block diagram of general type II one step majority logic decoder and explain the
error correction process. C
-3

(10 Marks)
-V
U

Module-5
a. For the convolutional encoder shown in Fig.Q9(a), find the output for the message (10111)
VT

9
C

using : m
-V

(i) Time domain approach

8p
(ii) Transform domain approach and verify the result

C
C

:5

-V
-V

34

C
C

-V
01
-V

C
20
C

-V

Fig.Q9(a) (14 Marks)

-V

b. Write the block diagram of suitable catastrophic encoder and explain. (06 Marks)
20

OR
VC

8-

-V

10 a. The convolutional encoder is as shown in Fig.Q10(a).

-0

C
31

-V
C
-V

Fig.Q10(a)
(i) Write the state table
C

(ii) Write the state diagram

-V

(iii) Trellis diagram (encoder) and trace the code output code for the message (1101)
(15 Marks)
b. Discuss the viterbi convolutional decoding algorithm. (05 Marks)
C

*****
-V

2 of 2
VC
 18ECS23

pm
USN

2
Second Semester M.Tech. Degree Examination, June/July 2019

:0
Error Control Coding

1
Time: 3 hrs. Max. Marks: 100

:2
Note: Answer any FIVE full questions, choosing

01

C
ONE full question from each module.
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

-V
9
Module-1

01

C
1 a. Define mutual information. Derive and explain the properties of mutual information.

-V
-2 (10 Marks)
b. A discrete memory less source has alphabet of five symbols with their probabilities as given
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

C
below :
07

-V
Symbol S0 S1 S2 S3 S4
Probabilities 0.4 0.2 0.2 0.1 0.1
6-

C
-0

Compute Huffman code by placing composite symbol as high as possible and by placing
-V
composite symbol as low as possible. Also find the :
U

i) The average code word length

VT

ii) The variance of the average code word for both of the cases.
C

(10 Marks)
m
-V

8p
OR
2 a. For a set integers G = {0, 1, 2, - - - m – 1} where m is nay +ve integer, show that

C
C

:2

(i ⊞ j) ⊞ k = i ⊞ (j ⊞ k) where ⊞ denotes module in addition. -V (08 Marks)

-V

b. Explain the construction of Galois field GF(2m) a field F.

57

(08 Marks)
c. Let V be a vector space over a field F.
C
C

-V

Prove that for any C in F and any V in V (–C)⋅(V) = C⋅(–V) = –(C⋅V). (04 Marks)
01
-V

Module-2
C
19
C

-V

3 a. The syndrome of a (7, 4) linear code is given by :

-V

S0 = r0 + r3 + r5 + r6
20

S1 = r1 + r3 + r4 + r5
C
VC

S2 = r2 + r4 + r5 + r6
7-

-V

Find the following :

i) Find the generator matrix draw the encoder circuit
-0

ii) Draw syndrome circuit

06

iii) Find all possible code vectors

-V

iv) How many errors can it detect and correct?

v) Detect and correct errors if r = 1001010. (14 Marks)
C

b. If C = DG is a valid code vector prove that CHT = 0 where HT is transpose of parity check
-V

matrix H. (06 Marks)

OR
C

4 a. Write a note on product codes and interleaved codes. (10 Marks)

-V

b. Form the generator matrix of a second order reed Muller code RM (r = 2, m = 4) of

length 16. What is the minimum distance of the code? (10 Marks)
C

1 of 2
-V
VC
 18ECS23

pm
Module-3

2
a. A (15, 5) binary cyclic code has a generator polynomial g(x) = 1 + x + x2 + x4 + x5 + x8 + x10.

:0
5
i) Draw the encoder block diagram

1
ii) Find the code polynomial for message polynomial d(x) = 1 + x2 + x4 in systematic form.

:2
iii) Is v(x) = 1 + x4 + x6 + x8 + x14 is a code polynomial? If not find the syndrome of v(x).
(10 Marks)

01

C
b. With a block diagram, explain the decoding operation of error trapping decoder for a(15, 7)

-V
cyclic code generated by g(x) = 1 + x4 + x6 + x7 + x8. (10 Marks)

9
01

C
OR
With a block diagram explain decoding circuit for (31, 26) cyclic Hamming code generated

-V
6
by g(x) = 1+ x2 + x5. If the above Hamming code is shortened by three digits. Draw and
-2
explain the decoding circuit for resultant (28, 23) shortened cyclic code. (20 Marks)

C
07

-V
Module-4
6-

7 a. Give the circuit for Galois field GF(24) adder and multiplier (for multiplying GF(24) by 3)
C
-0

and explain their operation. What is requirement of these circuits? (10 Marks)
-V
b. Give the important parameters and features of RS code. Give the encoding circuit for q-ray
U

R - S code and explain the symbols used in the circuit. (10 Marks)
VT

OR m
-V

a. Example with suitable diagram type-I one step majority logic decoder error correction
8p
8
procedure. (10 Marks)

C
C

b. Draw and explain type-2, two step majority logic g(x) = 1+ x + x3.
:2

-V
-V

1 0 0 1 0 1 1
57

H  0 1 0 1 1 1 0 .
C

(10 Marks)
C

-V

0 0 1 0 1 1 1
01
-V

Module-5
19
C

-V
-V

1
9 a. For a rate convolutional encoder with a transfer function :
20

2
C

G ( x )  [1  x 2  x 3 , 1  x  x 2  x 3 ] , draw the encoder circuit and state diagram, hence

VC

7-

-V

evaluate the codeword produced by the input sequence 1 0 1 1 1. (10 Marks)

b. With a flow chart explain ZJ or stack algorithm. (10 Marks)
-0

C
06

OR
-V

10 a. Explain the steps involved in viterbi algorithm. (06 Marks)

b. Consider the convolutional encoder with g( x )  [1  x, 1 x 2 , 1  x  x 2 ] . If the received
C

sequence v = [110, 110, 110, 111, 010, 101, 101]. Using Viterbi algorithm find the
-V

transmitted bit sequence. Assume that the codeword is transmitted over BSC channel.
(14 Marks)
C
-V

*****
C

2 of 2
-V
VC
 16/17ECS22

pm
USN

9
Second Semester M.Tech. Degree Examination, June/July 2019

:1
Error Control Coding
Time: 3 hrs. Max. Marks: 80

2
:5
Note: Answer FIVE full questions, choosing one full question from each module.

12

C
Module-1
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

-V
1 a. Construct the group under modulo-6 addition and modulo-3 multiplication. (06 Marks)

9
b. Define the following term:

01

C
(i) Group (ii) Field. (03 Marks)

-V
c. Brief out the following:
(i) -2
Characteristics of field. (ii) Properties of field. (07 Marks)
PImportant Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

C
06
OR

-V
2 a. Consider the primitive polynomial P(z )  1  z  z 4 over GF(2). Display the polynomial and
7-

vector representation of each element. (08 Marks)

C
-0

4
b. Solve for x and y from the following linear equations over GF(2 ) :
-V
x  7 y  2 ; 2   8 y   4 (08 Marks)
U
VT

Module-2
m
-V

3 a. Consider a systematic (8, 4) code whose parity check equation are V0  1   2   3 ,

2p
V1   0  1   2 , V2   0  1   3 and V3   0   2   3 where  0 , 1 ,  2 and  3 are

C
C

message digit and V0 , V1, V2 and V3 are parity check digit.

:0

-V
-V

Find (i) The generator matrix

05

(ii) The parity check matrix for the code.

C

(iii) Show that analytically the minimum distance is 4.

C

(08 Marks)
:

-V

b. Write a node on Reed-Muller code.

01

(08 Marks)
-V

OR
C

1 0 1
19
C

a. For a systematic (6, 3) linear block code, the Parity matrix ‘P’ is given by, P  0 1 1 .
-V

4
-V

 
20

1 1 0
C

(i) Construct the standard array table for the codewords.

VC

6-

-V

(ii) If the received bit pattern r  1 0 11 0 0 , determine the syndrome and draw the circuit.
(10 Marks)
-0

b. Explain product code and interleaved code. (06 Marks)

C
07

-V

Module-3
5 a. In a (7, 4) cyclic code, the generator polynomial is given by g( x )  1  x  x 3
C

(i) Write encoder and decoder circuit.

-V

(ii) Find code word for message 1 0 1 1 and show register contents for all steps.
(iii) From given g(x) obtain generator matrix.
(iv) If 1 0 1 0 1 1 0 is the received code, is it valid?
C

(12 Marks)
b. Show that the generator polynomial g(x) of an (n, K) cyclic code is a factor of X n  1 .
-V

(04 Marks)
1 of 2
C
-V
VC
 16/17ECS22

pm
OR
6 a. With the help of Meggit decoder diagram, explain the general decoder operation for (n, K)
cyclic code. (08 Marks)

9
b. Write note on shortened cyclic codes with example. (08 Marks)

2 :1
Module-4

:5
7 a. Prove that t-error correcting BCH code indeed has a minimum distance of at least (2t+1).
(10 Marks)

12

C
b. Explain decoding steps in RS code. (06 Marks)

-V
9
OR

01

C
8 a. Discuss the type-II one step majority logic decoding. (08 Marks)

-V
b. Explain the iterative algorithms for finding the error location polynomial (X ) in BCH
-2
codes. (08 Marks)

C
06

-V
Module-5
7-

9 a. Draw the block diagram of binary rate R  2 non-systematic feed forward convolution
C 3
-0

codes with memory order m = 1. If  =(1 0 1) and  2 =(1 1 0). Compute the output
1
-V
U

vector V. (10 Marks)

b. Explain the distance properties of convolution codes.
VT

(06 Marks)
C

m
-V

OR
2p
10 a. In a (2, 1, 3) convolution encoder, the impulse response is given by g 0  1 0 1 1 and

C
C

g1  1 1 1 1.
:0

-V
-V

(i) Draw the encoder circuit.

05

(ii) For the message   [1 0 1 1 1] find the codeword. (10 Marks)

C
C

b. Explain Zj (slack) sequential decoding. (06 Marks)

:

-V
01
-V

*****
19
C

-V
-V

20

C
VC

6-

-V
-0

C
07

-V
C
-V
C
-V
C

2 of 2
-V
VC
 16/17ECS22

pm
USN

2
Second Semester M.Tech. Degree Examination, Dec.2018/Jan.2019

:5
Error Control Coding

4
Time: 3 hrs. Max. Marks: 80

:0
Note: Answer any FIVE full questions, choosing one full question from each module.

02

C
2. Any revealing of identification, appeal to evaluator and /or equations written eg, 42+8 = 50, will be treated as malpractice.

-V
Module-1
1 a. Define source encoding theorem. Show that L  H (s). . (08 Marks)

8
b. Define (i) Primitive polynomial (ii) Finite field. (04 Marks)

01

C
2m 1
c. Show that any irreducible polynomial over GF(2) of degree ‘m’ divides X  1 with an

-V
example. -2 (04 Marks)
Important Note : 1. On completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

C
12
OR

-V
2 a. Construct Galois field GF(24) based on primitive polynomial P(X) = 1+ X + X4. (06 Marks)
7-

b. Let  be the primitive element in GF(24). Use table generated in Fig. Q2 (a) to solve the
following simultaneous equations for X, Y and Z. Verify the result using Cramer’s method.
C
-0

X  7 y  2
-V
U

12 X   8 y   4 (05 Marks)

VT

c. Define linearly dependent and independent set of vectors. Show that (10110)(01001) and
C

(11011) vectors are linearly independent. m (05 Marks)

-V

4p
Module-2

C
C

3 a. Consider a systematic (7, 4) linear block code whose parity matrix P is given as,
:0

-V
-V

0 1 1
10

1 0 1
C
C

1 1 0
:

-V
02
-V

1 1 1
(i) Find G and H matrix (ii) Draw the corresponding Encoding circuit for this code for
C
18
C

a message (V0, V1, V2, V3). (iii) Find the code words. (10 Marks)
-V

b. With the parity check matrix resulting in Q3 (a), obtain the syndrome circuit.
-V

(06 Marks)
20

OR
VC

4 a. Design an RM (Reed Muller) code (16, 11) with a minimum distance of 4.

2-

-V

(08 Marks)
b. For (6, 3) linear code generated by,
-1

0 1 1 1 0 0
C

G  1 0 1 0 1 0 .
07

-V

1 1 0 0 0 1
Obtain standard array. (08 Marks)
C
-V

Module-3
5 a. With a neat general block diagram of the Meggit decoder, explain the decoding. (08 Marks)
C

b. Explain the (7, 4) cyclic code encoding operation for a generator polynomial
-V

g( x )  1  x  x 3 with an encoding circuit for the message U = (1 0 1 1). (08 Marks)

1 of 2
C
-V
VC
 16/17ECS22

pm
OR
6 a. Explain decoder for a cyclic Hamming code with a neat diagram and necessary steps.
(08 Marks)

2
3
b. Draw the syndrome circuit for the (7, 4) cyclic code with g( x )  1  x  x and find the

:5
received vector (0 0 0 1 0 1 1) syndrome. (08 Marks)

4
:0
Module-4
7 a. With the parameters of Reed Solomon codes explain encoder circuit for a q-ary RS code.

02

C
(08 Marks)

-V
b. With an appropriate diagram explain general type-I one step majority logic decoder.
(08 Marks)

8
01

C
OR

-V
8 a. With a neat diagram, explain adding and multiplying of any two elements in GF(24) . Use
-2
P(x )  1  x  x 4 to generate GF(24). (10 Marks)

C
12
b. Obtain the generator polynomial for single error, double error and triple error correcting

-V
BCH codes of length 15. The minimal polynomial of , 3, 5 are 1  x  x 4 ,
7-

1  x  x 2  x 3  x 4 , 1+x+x2 respectively. (06 Marks)

C
-0

-V
Module-5
U

9 a. Generate the (3, 1, 2) convolution code for the message (1 0 1 0 1) assuming g (0)  1 0 0 ,
VT

g (1)  1 0 1 and g ( 2)  111 . Draw the encoder diagram, state diagram, tree diagram and
C

trellis diagram. m
-V

(10 Marks)
4p
(0) (1) (2)
b. Consider the (3, 1, 2) encoder with g = 1 1 0 , g = (1 0 1) and g = (1 1 1). Compute

C
(i) Transfer domain generator matrix G(D).
C

:0

(ii) Output sequences for U (D)  1  D 2  D 3  D 4-V

-V

(iii) Code word for correspondence sequence to the information sequence

10

V( D)  1  D 2  D 3  D 4 . (06 Marks)
C
C

-V
02
-V

OR
10 a. Consider convolutional encoder with g1(x) = 1 + x + x2 and g2(x) = 1 + x2 if the received
C

sequence is z  (11, 01, 01, 10, 01) , using the Viterbi algorithm find the transmitted bit
18
C

-V

sequence.
-V

(10 Marks)
b. Explain feedback decoding and demonstrate the process of decoding using the received
20

sequence Z = 1100010001.
C

(06 Marks)
VC

2-

-V
-1

*****
C
07

-V
C
-V
C
-V
C

2 of 2
-V
VC
USN 16/17ECS/ELD22

Second Semester M.Tech. Degree Examination, June/July 2018

Error Control Coding

Time: 3 hrs. Max. Marks: 80

Note: Answer FIVE full questions, choosing
ONE full question from each module.

Module-1
1 a. Define mutual information of the channel and state the properties. (08 Marks)
b. Define a group, and construct the group under module–5 addition and multiplication over
GF(5). (08 Marks)

OR
2 a. Define channel capacity of a discrete memory less channel consider a binary symmetric
channel with equal source input probabilities, for conditional error probability of ‘p’ show
that the channel capacity C is given by C = 1 – H(p). (06 Marks)
b. Construct a table for GF(24) based on the primitive polynomial p(X) = 1 + X + X4. Display
the power polynomial and vector representations of each element. (06 Marks)
1 1 0 1 1 0 0
c. Given the matrix G write the parity check matrix H and G 1 1 1 0 0 1 0 .
0 1 1 1 0 0 1
Show that the raw space of G is the null space of H. (04 Marks)

Module-2
3 a. For a systematic (7, 4) linear block code the priority matrix is given by P :
i) Draw the encoding circuit
ii) Draw the syndrome calculation circuit
iii) Detect and correct the error in the received vector R = [1 0 1 1 1 0 0].
1 1 1
1 1 0
p . (10 Marks)
1 0 1
0 1 1
b. Discuss the reed Muller code and its properties. (06 Marks)

OR
4 a. For a (6, 3) linear code generated by the G matrix :
0 1 1 1 0 0
G 1 0 1 0 1 0
1 1 0 0 0 1
i) Construct the standard array (with one bit error)
ii) Determine the probability of decoding error if the transition probability for a BSC is p = 10–2
iii) Correct any errors in the received vector. 1 = (010110) and 2 = (011101). (10 Marks)
b. Construct the generator matrix and parity check matrix with n = 5 for
i) Single parity check code ii) Repetition code. (06 Marks)
1 of 2
 16/17ECS/ELD22

Module-3
5 a. Design an encoder for a (7, 4) cyclic code with g(x) = 1 + x + x3. Find the code word for the
message (1010) with shift register contents. (06 Marks)
b. Write the decoding circuit for the (7, 4) cyclic code generated by g(x) = 1 + x + x3. Describe
the error correction process for the received word = (1011011), shift into the shift register
from left end. (10 Marks)

OR
6 a. Prove that an (n, k) linear code C is cyclic if every cyclic shift of a code word in C is also a
code word in C. (06 Marks)
b. With a neat diagram explain the principle of operation of (31, 26) decoding circuit for a
cyclic hamming code, generated by g(x) = 1 + x2 + x5 what modification is required for
(28, 23) shortened cyclic code. (10 Marks)

Module-4
7 a. Describe the parameters of binary primitive BCH codes and determine g(x) for double error
correction and triple error correction. (08 Marks)
b. Write the Galoisfield implementation of multiplying an arbitrary element in GF(24) by 23
with (X) = 1 + X + X4. (08 Marks)

OR
8 a. Evaluate the syndrome for the double error correcting (15, 7) BIH code with received vector
= (1000 0000 1000 000). (08 Marks)
b. With a neat block diagram explain the operational steps of general type – II one step
majority logic decoders. (08 Marks)

Module-5
9 a. i) Develop the convolutional encoder with k = 4, rate ½
g1(x) = 1 + x2 + x3, g2(x) = 1 + x + x2 + x3.
ii) Determine the code word for the message m = 11101 with initial condition as zero.
(10 Marks)
b. Discuss the feedback decoding method to decode the convolutional code at the receiver.
(06 Marks)

OR
10 a. Write the convolutional encoder with k = 3, rate½
g1(x) = 1 + x + x2, g2(x) = 1 + x2
b. Write the state diagram
c. Write the decoding trellis diagram
d. Correct the error in the received sequence Z = 1101011001 using viterbi algorithm.
(16 Marks)

*****

2 of 2
USN 16ECS/ELD22

Second Semester M.Tech. Degree Examination, Dec.2017/Jan.2018

Error Control Coding

Time: 3 hrs. Max. Marks: 80

Note: Answer any FIVE full questions, choosing one full question from each module.

Module-1
1 a. Define Group and Field. (05 Marks)
b. Prove with an example, an irreducible polynomial over GF (2) of degree ‘m’ diveides
m
X2 1 1 . (05 Marks)
c. For joint probability matrix given in Fig. Q1(c), find H(x), H(y), H(x/y), H(y/x) and H(x,y)
0.25 0 0 0
0.1 0.3 0 0
Jpm 0 0.05 0.1 0
0 0 0.05 0.1
0 0 0.05 0
Fig Q1(c) (06 Marks)

OR
2 a. Construct a table for GF(24) based on primitive polynomial P(x) = 1 + x + x4. List the power
polynomial, n-tuple representation of each element. (08 Marks)
b. Discuss the properties of mutual information. (08 Marks)

Module-2
3 a. For a (7, 4) linear block code the parity matrix is given by
1 1 1
1 1 0
P
1 0 1
0 1 1
i) Write all possible code vector
ii) Draw the encoder circuit
iii) Draw syndrome calculation circuit. (10 Marks)
b. Define: i) Single parity check codes ii) Repetition codes iii) Self qual codes. (06 Marks)
OR
4 a. For a systematic (6, 3) Linear block code, the parity matrix [P] is
1 0 1
0 1 1
1 1 0
Construct standard array table for the code words.
If the received bit pattern r = [1 0 1 1 0 1], determine syndrome, correctable error pattern and
corrected code vector for a single bit error. (10 Marks)

1 of 2
 16ECS/ELD22

b. Explain the Rud Muller codes. (06 Marks)

Module-3
5 a. For a (7, 4) cyclic code with generator polynomial g(x) = 1 + x + x3, find the code vector for
messages i) 0010 ii) 0100 iii) 1001 iv) 1101 v) 1111 in systematic and non-systematic
form. (10 Marks)
b. Explain the steps involved in encoding of (n, k) cyclic code using parity check polynomial.
(06 Marks)

OR
6 a. A (15, 5) linear cyclic code has a generator polynomial g(x) = 1 + x + x2 + x4 + x5 + x8 + x10.
i) Draw the block diagram of encoder
ii) Find the code polynomial for message polynomial D(x) = 1+x2 + x4. (10 Marks)
b. Explain Error Trapping decoder. (06 Marks)

Module-4
7 a. Explain Binary primitive BCH codes. (08 Marks)
b. Draw the block diagram of a Galois field adder and explain it. (08 Marks)

OR
8 a. Draw the block diagram of a General type – II one step majority logic decoder and explain
it. (08 Marks)
b. Discuss error correction procedure of a general type – II L – step majority logic decoder.
(08 Marks)

Module-5
9 a. A rate 2/3 non systematic feed forward convolutional encoder shown in Fig. Q9(a).
i) Find generator polynomials
ii) Find the code wards if V1(D) = 1 + D2 and V2 (D) = 1 + D. (08 Marks)

Fig. Q9(a)
b. Discuss the distance properties of convolutional codes. (08 Marks)

OR
10 a. For (3, 1, 2) Non-systematic feed forward encoder with G(D) = [1 + D, 1 + D2, 1 + D + D2]
and information sequence of length = 5. The received sequence is r = [110, 110, 110, 111,
010, 101, 101].
Find the message sequence using viterbi decoding algorithm. (10 Marks)
b. Explain sequential decoding algorithm. (06 Marks)

*****
2 of 2
USN 14ECS41

Fourth Semester M.Tech. Degree Examination, Dec.2017/Jan.2018

Error Control Coding

Time: 3 hrs. Max. Marks:100

Note: Answer any FIVE full questions.

1 a. Define Group and Field with necessary conditions. (06 Marks)

b. Construct the modulo – 7 addition and multiplication tables. (04 Marks)
4
c. ). Using Galois Field arithmetic, solve the equations
for x, y and z.
5 7
x y z
7 9
x y z
2 6
x y z (10 Marks)

2 a. For a systematic (7, 4) linear block code, the 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) If the received vector is r = [1 0 0 1 0 0 1], detect and correct the error if any.
(10 Marks)
b. Consider a (6, 3) linear code whose generator matrix is
1 0 0 1 0 1
G 0 1 0 1 1 0
0 0 1 0 1 1
i) Find all code vectors
ii) Find all Hamming weights and distances (05 Marks)
c. Write a short note on Reed Muller codes. (05 Marks)

3 a. Consider the (7, 4) cyclic code generated by g(x) = 1 + x + x3

i) Determine all valid codewords in systematic form.
ii) Find Generator matrix in systematic form
iii) Draw encoding circuit based on g(x) for the message (1 0 1 1) (12 Marks)
b. Explain Meggitt decoder. (08 Marks)

4 4
4 a. Let = 0. If the
3 4 2
are 1 (x) = 1 + x+ x and 3 (x) = 1 + x + x + x3 + x4
respectively.
i) Compute the generator polynomial for double error correcting (15, 7) BCH code
ii) Compute the syndrome for erro correction if the vector is
r=[10000000 1000000] (12 Marks)

1 of 2
 14ECS41

b. Draw a neat diagram of encoding circuit for a q-ary RS code with generator polynomial
g( x ) g 0 g1 x g 2 x 2 . . . . . . + g 2 t 1x 2 t 1 x 2 t and explain. (08 Marks)

5 a. Give the block schematic of general type – II one step majority logic decoder and explain
error correction procedure. (10 Marks)
b. Consider the maximum length code with m = 4 and parity polynomial P(x) = 1 + x + x4.
This code has block length n = 15 and minimum distance d = 8. The generator polynomial of
x15 1
this code is g(x) = .
p( x )
Find the null scope of this code and parity check sums. (10 Marks)

6 a. A rate R = ½ non systematic feed forward convolution encoder (2, 1, 3) shown in Fig.
Q6(a). Find the codeword for input sequence (1 0 1 1 1 ) using convolution and matrix
approach.

Fig. Q6(a) (12 Marks)

b. Draw the flowchart of stack algorithm and mention the steps of algorithm. (08 Marks)

7 a. Explain and derive necessary equations for multilevel concatenated encoder. (10 Marks)
b. Explain the basic turbo encoding structure with neat block diagram. (10 Marks)

8 a. With a neat block diagram, explain the steps involved in an error trapping decoder for burst
error – correcting code. (10 Marks)
b. Explain the Berlekamp – pre-parata codes for burst – error – correcting for convolution
codes. (10 Marks)

*****

2 of 2