Professional Documents
Culture Documents
CTT Q1
CTT Q1
1.a) A discrete memoryless source has an alphabet of eight letters xi, i = 1, 2, . . . , 8, with
probabilities 0.25, 0.20, 0.15, 0.12, 0.10, 0.08, 0.05, and 0.05.
i) Use the Huffman encoding procedure to determine a binary code for the source output.
ii) Determine the average number R’ of binary digits per source letter.
iii) Determine the entropy of the source and compare it with R.
b) Explain about Shannon Fano Coding. [8+7]
3.a) Derive expressions for block error probability and bit error probability of Linear Block
Codes.
b) Consider a linear block code with codewords {0000, 1010, 0101, 1111}. Find the dual of
this code and show that this code is self-dual. [8+7]
4.a) Explain syndrome computation and error detection of cyclic block codes.
b) Determine the correctable error patterns (of least weight) and their syndromes for the
systematic (7, 4) cyclic Hamming code. [8+7]
6. Discuss the error trapping decoder for cyclic codes in detail. [15]
--ooOoo--