Scribd
Upload
120 views

A7005-Coding Theory and Practice

This document contains 8 questions related to coding theory and practice for an exam. The questions cover various topics in coding theory including: 1) Shannon-Hartley law and encoding methods like Shanon-Fano and Huffman coding. 2) Differences between instantaneous and non-instantaneous codes, properties of Hamming codes. 3) Perfect codes, linear block codes, generator and parity check matrices. 4) Cyclic encoding and decoding. 5) Finite fields and properties of irreducible polynomials. 6) Convolutional encoding and decoding using code trees. 7) Concatenated codes and code interleavers. 8) BCH codes over Galois fields

Uploaded by

hari0118
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
120 views

A7005-Coding Theory and Practice

This document contains 8 questions related to coding theory and practice for an exam. The questions cover various topics in coding theory including: 1) Shannon-Hartley law and encoding methods like Shanon-Fano and Huffman coding. 2) Differences between instantaneous and non-instantaneous codes, properties of Hamming codes. 3) Perfect codes, linear block codes, generator and parity check matrices. 4) Cyclic encoding and decoding. 5) Finite fields and properties of irreducible polynomials. 6) Convolutional encoding and decoding using code trees. 7) Concatenated codes and code interleavers. 8) BCH codes over Galois fields

Uploaded by

hari0118
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code No: A7005

JAWAHRLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


M. Tech I Semester Supplementary Examinations September 2009
CODING THEORY AND PRACTICE
(Electronics & Communications)
Time : 3hours Max.Marks:60
Answer any FIVE questions
All questions carry equal marks
---
1.a) Define channel capacity according Shannon-Hartley law, stating the law.
b) A source output has 10 equally likely messages. Generate the code words for these
messages, Compute the average code word length & coding efficiency according to
i. Shanon-Fano Encoding
ii. Huffman Encoding.

2.a) Differentiate between instantaneous and non-instantaneous codes.


b) Show that (7,4) Hamming code is a distance three code.
c ) Determine the relationship between ‘n’, the total No. of bits in the coded word and
‘k’, the No. of check bits in the coded word of (n, k) Hamming code.

3.a) What are perfect codes? Give an example.


b) If the received code word ‘r’ is 110001 for a source when (6, 3) systematic Linear
Block Code is used and the parity check equations for code word generation are
P0 = U0 XOR U2; P1 = U0 XOR U1; P2 = U1 XOR U2
i. Construct the generator and parity check matrices.
ii. Calculate the syndrome of ‘r’ and locate the error if any.

4. a) Design a (7, 4) binary cyclic encoder with the generator polynomial G (x) = (1 +
x2 + x3).
b) With the help of an assumed received code word and a suitable decoding
procedure, explain decoding of a cyclic coded word.

5. a) What are finite fields?


b) List the laws an irreducible polynomial should satisfy over a binary Galois field
GF (2).
c) Show that the polynomial (1 + x3 + x5) is the minimal polynomial over GF (2).

6.a) For the (3, 1, 2) convolutional code with g(1) = (1 1 0), g(2) = (1 0 1), g(3) = (1 1 1),
i. Draw the encoder diagram.
ii. Find the generator matrix and the parity check matrix.
iii. Find the code word for the input sequence u = (1 1 0 1).
b).Construct a code tree to decode the encoded signal of the convolution encoder of 6

7. a. Write a short notes on concatenated codes.


b.Describe the necessity of code interleavers and the steps involved in their
implementation.

8. a. Define BCH codes over G F (q). Specify BCH relations to define BCH codes over
any field.
b. Construct the generator polynomial for double error correcting BCH codes with a
primitive element ‘α’ over GF (24) for 1 + α + α4 = 0. Assume relevant minimal
polynomials.
****

You might also like