tanszek:oktatas:techcomm:encoding_techniques
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| tanszek:oktatas:techcomm:encoding_techniques [2025/11/23 18:09] – [Encoding Techniques] kissa | tanszek:oktatas:techcomm:encoding_techniques [2025/11/23 18:43] (current) – [Exercises] kissa | ||
|---|---|---|---|
| Line 24: | Line 24: | ||
| c) What will be the entropy and redundancy of this code if the occurrence of numbers in the range 40 $\leq$ n $\leq$ 69 is four times more frequent than the occurrence of numbers in the range 70 $\leq$ n $\leq$ 119? | c) What will be the entropy and redundancy of this code if the occurrence of numbers in the range 40 $\leq$ n $\leq$ 69 is four times more frequent than the occurrence of numbers in the range 70 $\leq$ n $\leq$ 119? | ||
| - | d) How many bits would the messages be if we used pure binary coding with parity checking? | + | d) How many bits would the messages be if we used pure fixed-length |
| ===== Huffman ===== | ===== Huffman ===== | ||
tanszek/oktatas/techcomm/encoding_techniques.txt · Last modified: 2025/11/23 18:43 by kissa