Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

www.jntuworld.

com

NR
Code No: B3803
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M.Tech II Semester Supplementary Examinations March/April 2010
CODING THEORY & TECHNIQUES
(DE&CS)
Time: 3hours Max.Marks:60
Answer any five questions
All questions carry equal marks
---
1.a) What are the properties of prefix codes?
b) Why source coding is required?
c) Find the entropy of the source transmitting four symbols with probabilities of 0.4,
0.2, 0.2, 0.2?

2.a) Design a Shannon-Fano coding for the following symbols and their probabilities
a1 − 0.5, a2 − 0.2, a3 − 0.2, a4 − 0.05, a5 − 0.05
b) Write Lempel – Ziv algorithm.

3.
⎡1 0 0 0 1 1 0 1 ⎤
⎢0 1 0 0 1 0 1 1 ⎥
L D
Consider an (8, 4) systematic code whose parity check matrix is

H =⎢

R

⎢0 0 1 0 1 1 1 0⎥
⎢ ⎥
(i)
⎣0 0 0 1 0 1 1 1⎦
O
Express the syndrome bits in terms of the received word bits.

4.a)
(ii)

W
Construct the syndrome circuit for this code.
(iii) Construct the standard array of this code.

U
Show that Hamming codes achieve the Hamming bound.
b)
desired.
(i)
N T
A fairly good linear code of length n = 63 with the minimum distance dmin = 5 is

Determine the range of parity check bits.

5.
(ii)
JFind the largest possible value of k.

Consider the (7, 4) cyclic hamming code generated by g(x) = 1 + x + x3. The r(x)
is fed into the syndrome register from the right end.
(i) What is the syndrome when a single error occurs at the location e(x) = x6?
(ii) Derive the decoding circuit for this code.

6. For the (3,1) systematic convolution code with m = 5, the generator sequences are
given as g(1) = ( 100000 ) , g(2) = ( 101101 ) and g(3) = ( 11011 )
(i) Find the generator matrix of this code?
(ii) Find the code word corresponding to the information sequence
d = (1101)?

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 = (010, 010, 001, 110, 100, 101, 011)

8. Determine the generator polynomial of all the primitive BCH codes of length 31.
Use the Galois field GF (25) generated by p(x) = 1 + x2 + x5.
*******

www.jntuworld.com

You might also like