| |
| | data compression (Site not responding. Last check: 2007-10-13) |
 | | This immediately leads to all the standard properties for canonical Huffman codes, including "the all-zeros code is the longest code", "the all-ones code is the shortest code", etc. In a few initial data files (for example, aabbeeee), letters are already in a power-of-2 frequency distribution, and the total file length is already a power-of-2. |
 | | Fibonacci codes, rather than having a unary code of 0 bits that ends at the 1st 1 bit, instead has a more compact code that ends the first time it hits 2 consecutive 1 bits. |
 | | http://www.ics.uci.edu/~dan/pubs/DC-Sec3.html#Sec_3.3 >3.3 Universal Codes and Representations of the Integers... |
| edge.box.sk /projects/archives/papers/compression/data_compression.html (13373 words) |
|