MU Information Technology (Semester 4)
Information Theory and Coding
December 2015
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) Derive expression for entropy?
5 M
1 (b) What is lossless compression?
5 M
1 (c) List attacks threatening security goals.
5 M
1 (d) Explain the role of digital signature.
5 M

2 (a) Explain LZW compression algorithm with example.
10 M
2 (b) For DES symmetric algorithm, explain main steps involved showing block size, cipher key size and round key size.
10 M

3 (a) For (7, 4) cyclic code, find-out the generator matrix if G(D)=1+D+D3.
10 M
3 (b) Describe Huffman decoding procedure with example.
10 M

4 (a) Explain Diffie-Hellman algorithm. Which attack is it valnerable to?
10 M
4 (b) Describe convolution code in brief.
10 M

5 (a) State Fermat's Little Theorem with example and its applications.
10 M
5 (b) Describe lossy compression methods. Where we use lossy compression methods? How do we are it?
10 M

6 (a) Describe Chinese-Remainder Theorem and its applications.
10 M
6 (b) Define
i) Hamming distance
ii) Hamming Weight
iii) Syndrome
iv) Linear properties of code
v) Code rate
10 M



More question papers from Information Theory and Coding
SPONSORED ADVERTISEMENTS