VEERMATA JIJABAI TECHNOLOGICAL INSTITUTE

Matunga, Mumbai-400 019

Autonomous Institute affiliated to University of Mumbai

EXAMINATION End Semester Examination DATE OF EXAM 28/04/2021

April 2021
SEMESTER & PROGRAM Sem-VIII, Final Year B Tech TIME 11: 00 to 1:00pm
(ExTc)
TIME ALLOWED 2hrs MARKS 60
COURSE NAME – (CODE) Coding Theory (ET4012S)
Instructions 1. All questions carry equal marks.
2. Figures to the right indicate full marks.
3. Assume additional data if necessary

Q1 a Write extension field GF (64) in power of primitive element α form and find the (04) Co1
multiplicative inverse of elements α5, α8, α19, α27, α39
b Write the extension field GF (64) in the form power of primitive element α and find (08) Co1
the conjugacy class of the elements α3, α5, α7, α11 in power of element α

Q2 a Write the Factorized form of X 31 + 1 over GF (2), considering (08) Co2

5 2
P(X) = X + X + 1 as primitive polynomial, state the number of possible generator
polynomial looking at factorized form for (31,15) systematic cyclic code
also construct any one generator polynomial

b Find the encoding sequence for (7,4) cyclic codes, consider g(X)= X 3 + X + 1 for (04) Co2
message bits 1 1 1 1 use shift registers, mod-2 adder, switches etc.

Q3 a Find the syndrome vector for (7, 4) cyclic code for received vector 1 0 1 1 0 0 0, (04) Co2
using shift register method, consider generator polynomial P(X) = X 3 + X 2 + 1 over
GF (2)
Explain the decoding procedure for the received sequence r = 1 0 0 1 0 0 1 using (08) Co2
b Meggitt cyclic decoder, consider the generator polynomial be g(X)= X 3 + X + 1
state which bit is in error

Q4 Write the survival path sequence using convolutional Viterbi decoder for the sequence (08) Co4
a 110010 received, consider (2,1,2) practical convolutional encoder with two generating
sequences g1= (1 1 1) and g2 = (1 0 1), also state the number of errors occurred
during transmission
b Find the generator polynomial for t=2 error correcting BCH codes with code length 31 (04) Co3
use Q2a if necessary, also find the dimension of code and minimum distance

Q5 a For a given 4x7 parity check matric for LDPC code, construct Tanner graph and state (06) Co5
the number of short cycles of length 4, the rows of a parity check matrix are 1 0 1 1 0
1 0, 1 0 1 0 1 0 1,0 1 0 1 0 1 0, 1 0 0 0 1 0 1
b Obtain the encoding sequence for practical convolutional (2,1,2) code with given generating (06) Co4
sequences g1 = (1 1 1) and g2 = (1 0 1) with message bits [m0, m1] = [1 1]