A discrete memory less source emits symbols from an alphabet containing $A, B$, $C, D, E, F$ and $G$ with probabilities $1 / 3,1 / 27,1 / 3,1 / 9,1 / 9,1 / 27,1 / 27$ respectively. Construct a source code using (b) Huffman procedure. Determine the efficiency and redundancy of the two codes.
Explanation
This question requires the application of the Huffman procedure for constructing a source code. The student needs to carefully create the binary tree by combining the least probable symbols and assign codes to each symbol. The resulting code should be efficient and have minimal redundancy.
⬆ 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) List down any four key characteristics of Light Rail Transit System (LRT).
- (i) Ruling gradient (ii) Pusher gradient (iii) Momentum gradient (iv) Grade compensation on curves
- (c) What is meant by interlocking of signals and points? List down any three essential regulations.
- (d) Describe the operation of centralized train control system (CTC).
- (e) What are the important wave characteristics? Write down the inter- relationship among these characteristics.