B.TECH - Semester 7 information theory and coding Question Paper 2008 (dec)
Practice authentic previous year university questions for better exam preparation.
Sample Questions
- Define the term Information. Give its unit.
- State Shannon's Source coding theorem.
- Find the capacity of Binary Symmetric Channel (BSC).
- Define Shannon's Limit.
- What are perfect codes?
- Give the properties of Abelian group? Give an example.
- What are Hamming codes?
- Define constraint length of convolutional code.
- Give the dimension of generator matrix for $(2,1,3)$ convolutional code for a message stream of 10110.
- What do you meant by symmetric key cryptography? ( $10 \times 4=40$ marks) P.T.O. Answer two questions from each Module. Each question carries 10 marks.
- State and prove Kraft's inequality.
- Consider a source emitting 5 symbols $x_{1}, x_{2}, x_{3}, x_{4}$ and $x_{5}$ with probabilities 0.4, $0.2,0.2,0.1$ and 0.1 respectively. Apply Huffman coding to generate the source codes and also find the efficiency.
- State and prove Shannon's Information Capacity Theorem. $$ (2 \times 10=20 \text { marks }) $$
- The parity check matrix for a $(7,4)$ linear block code is expressed as $$ H=\left[\begin{array}{lllllll} 1 & 1 & 1 & 0 & 1 & 0 & 0 \\ 1 & 1 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 & 1 \end{array}\right] $$ (a) Obtain the generator matrix
- The parity check matrix for a $(7,4)$ linear block code is expressed as $$ H=\left[\begin{array}{lllllll} 1 & 1 & 1 & 0 & 1 & 0 & 0 \\ 1 & 1 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 & 1 \end{array}\right] $$ (b) Find all possible codewords
- The parity check matrix for a $(7,4)$ linear block code is expressed as $$ H=\left[\begin{array}{lllllll} 1 & 1 & 1 & 0 & 1 & 0 & 0 \\ 1 & 1 & 0 & 1 & 0 & 1 & 0 \\ 1 & 0 & 1 & 1 & 0 & 0 & 1 \end{array}\right] $$ (c) Find the error correction capabil...
- The generator polynomial for a $(7,4)$ cyclic code is $g(X)=X^{3}+X+1$. Find the codeword in systematic form for the message sequence (a) 1100 (b) 1010 (c) 1001 (d) 1110 .
- Write a short note on (a) Reed-Solomon code (b) BCH code. ( $2 \times 10=20$ marks)
- A convolutional code is described by $g^{1}=[110], g^{2}=[101], g^{3}=[111]$. (a) Draw the encoder for the corresponding to this code
- A convolutional code is described by $g^{1}=[110], g^{2}=[101], g^{3}=[111]$. (b) State diagram
- A convolutional code is described by $g^{1}=[110], g^{2}=[101], g^{3}=[111]$. (c) Find the output sequence for $\mathrm{m}=1011$ using code tree.
- Explain about Data Encryption Standard with necessary diagrams.
- Explain Viterbi algorithm for the decoding of convolutional code. ( $2 \times 10=20$ marks)