Code: 9D38204

M.Tech - II Semester Regular & Supplementary Examinations, December 2013

CODING THEORY AND TECHNIQUES
(Common to DECS & ECE)
Time: 3 hours Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
*****
1 Explain the following in detail:
(a) Source coding theorem.
(b) Properties of prefix codes.
(c) Entropy.
(d) Channel capacity.

2 If the received word r is 100011 for a source using (6, 3) systematic linear block code, whose code
words are generated using party check equations, P
0
=( for a
message (
(a) Construct the generator and party check matrices.
(b) Calculate the syndrome of r.
(c) Locate if any error has occurred.

3 (a) Design a Shaneon-Fano coding for the following symbols and their probabilities

(b) Write Lempel Ziv algorithm.

4 (a) The polynomial is the generator polynomial for the (15, 11) Hamming binary code.
(i) Determine the generator matrix of this code in systematic form.
(ii) Determine the generator polynomial for the dual code.
(b) Let be a polynomial over the binary field.
(i) Find the lowest rate cyclic code where generator polynomial is
(ii) What is the rate of this code?

5 Construct the decoding table for a single error (7, 4) cyclic code whose generator polynomial is


6 Briefly explain the following:
(a) Structural properties of convolutional code.
(b) Trellis diagram.
(c) Convolutional interleaving.

7 (a) Write a stack sequential decoding algorithm for convolution codes.
(b) Draw the code tree for (3, 1, 2) code with L =5 and decode the sequence, r =(011, 100, 001, 111,
001, 011, 100).

8 Determine the generator polynomial of all primitive BCH codes of length 31. Use the halois field
GF( generated by

*****