|
Data Compression
Criteria
Survey Formats
Basics
Compression Methods
Shannon-Fano
Example
Algorithm
Step-by-Step
SF versus Huffman
Huffman
Lempel-Ziv (LZ)
Arithmetic Coding
Run Length Encoding
Burrows-Wheeler (BWT)
Implementations
Data Formats
Glossary
Index
Download
|

Step-by-Step Construction
Freq- 1. Step 2. Step 3. Step
Symbol quency Sum Kode Sum Kode Sum Kode
-----------------------------------------------
A 24 24 0 24 00
----------
B 12 36 0 12 01
--------------------------
C 10 26 1 10 10
----------------------
D 8 16 1 16 16 110
-----------
E 8 8 1 8 8 111
-----------------------------------------------
Code trees according to the steps mentioned above:
1. Schritt

2. Schritt

3. Schritt

< ^ >
|
|