通过最佳的文件压缩比节省空间并加快转移的速度。高效，快速且容易的文件管理！
1 Huffman = 0.6 LZMA
1 LZMA = 1.667 Huffman
例子:
将15 霍夫曼编码压缩转换为Lemple-Ziv-Markov算法：
15 Huffman = 9 LZMA
| 霍夫曼编码压缩 | Lemple-Ziv-Markov算法 |
|---|---|
| 0.01 Huffman | 0.006 LZMA |
| 0.1 Huffman | 0.06 LZMA |
| 1 Huffman | 0.6 LZMA |
| 2 Huffman | 1.2 LZMA |
| 3 Huffman | 1.8 LZMA |
| 5 Huffman | 3 LZMA |
| 10 Huffman | 6 LZMA |
| 20 Huffman | 12 LZMA |
| 30 Huffman | 18 LZMA |
| 40 Huffman | 24 LZMA |
| 50 Huffman | 30 LZMA |
| 60 Huffman | 36 LZMA |
| 70 Huffman | 42 LZMA |
| 80 Huffman | 48 LZMA |
| 90 Huffman | 54 LZMA |
| 100 Huffman | 60 LZMA |
| 250 Huffman | 150 LZMA |
| 500 Huffman | 300 LZMA |
| 750 Huffman | 450 LZMA |
| 1000 Huffman | 600 LZMA |
| 10000 Huffman | 6,000 LZMA |
| 100000 Huffman | 60,000 LZMA |
规则