100% found this document useful (1 vote)
957 views2 pages

Coding Theory & Techniques

This document contains questions for an exam on coding theory and techniques. It lists 8 questions related to topics such as: 1) Generator matrices, systematic linear block codes, and parity check matrices. 2) Hamming codes, perfect codes, weight enumerators, and MacWilliams identities. 3) Cyclic codes, encoding of convolutional codes, and likelihood decoding of convolutional codes. 4) The Viterbi algorithm, BCH codes, and decoding of BCH codes. 5) Entropy calculations and Huffman coding. 6) Source coding theorem, coding for discreteless sources, fixed length and variable length coding. 7) Shannon-Fano theorem and Lempel-

Uploaded by

Lakkepogu Ashok
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
100% found this document useful (1 vote)
957 views2 pages

Coding Theory & Techniques

This document contains questions for an exam on coding theory and techniques. It lists 8 questions related to topics such as: 1) Generator matrices, systematic linear block codes, and parity check matrices. 2) Hamming codes, perfect codes, weight enumerators, and MacWilliams identities. 3) Cyclic codes, encoding of convolutional codes, and likelihood decoding of convolutional codes. 4) The Viterbi algorithm, BCH codes, and decoding of BCH codes. 5) Entropy calculations and Huffman coding. 6) Source coding theorem, coding for discreteless sources, fixed length and variable length coding. 7) Shannon-Fano theorem and Lempel-

Uploaded by

Lakkepogu Ashok
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

----------------------- Page 1----------------------Code: 9D38204 M.

Tech - II Semester Supplementary April/May 2012 Examinatio ns (for students admitted in 2009- 10 & 2010-11 only) CODING THEORY & TECHNIQUES (Digital Electronics & Communications S ystems) Time: 3 hours Max. Marks: 60 Answer any FIVE Ques tions All Questions carry equa l marks

*****

1.

Define and (a) (b) (c) (a) (b) (a) (b)

explain the following Generator matrix. Systematic linear block codes. Parity check matrix.

2. 3. es. 4. 5.

Explain with example hamming codes and perfect codes. Write about weight enumerators and Mac Williams identities. Explain in briefly about cyclic codes and decoding of cyclic cod Write about algebraic structures of cyclic codes. Write about encoding of convolutional codes. Explain in detail likelihood decoding of convolutional codes. Write notes on (a) Viterbi algorithm and its applications. (b) BCH codes and procedure for decoding of BCH codes. Given following ensembles S={S ,S , S , S , S , S , S } 1 2 3 4 5

(a) (b)

6.

P(S)={1/3,1/3,1/9,1/9,1/27,1/27,1/27} (a) Find H(S) & H (S3 ). (b) Find a compact Huffman code when X= [1,1] & X[0,1,2]. Find the average length and efficiency for both above codes.

7.

Explain the following in detail. (a) Source coding theorem. (b) Coding for discreteless sources. (c) Fixed length and variable length coding. (a) (b) State and explain Shannon-Fano theorem. Explain about Lempel Ziv codes.

8.

*****

You might also like