and 3 others joined a min ago.
0
2.5kviews
Construct a Shannon Fano code for the source and calculate code efficiency, redundancy of the code. Repeat same for the Huffman source coding technique.
written 6.3 years ago by
kaveri
• 20
|
modified 2.4 years ago
by
Krishna_Agrawal
• 2.6k
|
Subject:- Digital Communication
Topic:- Information theory and source coding
Difficulty:- High
A discrete memory less source has an alphabet of five symbol with their probabilities as shown in
| Symbol | $m_1$ | $m_2$ | $m_3$ | $m_4$ | $m_5$ |
|---|---|---|---|---|---|
| Probability | 0.4 | 0.19 | 0.16 | 0.15 | 0.10 |
Construct a Shannon Fano code for the source and calculate code efficiency, redundancy of the code. Repeat same for the Huffman source coding technique.
ADD COMMENT
EDIT