The source symbols and associated probabilities of a five symbol DMS source is as follows | Symbols | X 1 | X 2 | X 3 | X 4 | X 5 | | :--- | :---: | :---: | :---: | :---: | :---: | | Probabilities | 0.1 | 0.15 | 0.16 | 0.19 | 0.4 | Construct a binary Huffman code and determine the code efficiency, code length and redundancy. 10
Explanation
Huffman coding is a variable-length prefix code that assigns shorter codes to more frequently occurring symbols. The code is constructed by combining the two least probable symbols and assigning a new code to the resulting symbol. This process is repeated until all symbols have been assigned a code. The code efficiency is calculated as 1 - (average code length / log2(n)), where n is the number of symbols.
⬆ Related Topic
📘 Syllabus
View KERALA UNIVERSITY Class 7 Syllabus →
📝 Practice Questions
Practice Previous Year Questions →
🤖 Practice with AI
Generate Practice Question Paper →
📚 Related Concepts
- (a) Explain the principle and working of (i) Zener diode (ii) LED
- Draw the block diagram of satellite transponder.
- Draw the block diagram of optical communication system.
- What are the factors that affect the Radar range?
- (b) Explain the necessity and effects of coning of wheels with the help of sketches.