245
edits
Difference between revisions of "SCI/Specifications/Resource files/Decompression algorithms/DCL-EXPLODE"
SCI/Specifications/Resource files/Decompression algorithms/DCL-EXPLODE (view source)
Revision as of 09:16, 31 January 2009
, 09:16, 31 January 2009Improved table formatting
(Merging of the SCI documentation) |
m (Improved table formatting) |
||
| Line 55: | Line 55: | ||
The first huffman tree (Section 2.3.2) contains the length values. It is described by the following table: | The first huffman tree (Section 2.3.2) contains the length values. It is described by the following table: | ||
{| border="1" | {| border="1" cellspacing="0" cellpadding="5" | ||
|+ | |||
|'''value (hex)''' | |'''value (hex)''' | ||
|'''code (binary)''' | |'''code (binary)''' | ||
| Line 114: | Line 115: | ||
The second huffman code tree contains the distance values. It can be built from the following table: | The second huffman code tree contains the distance values. It can be built from the following table: | ||
{| border="1" | {| border="1" cellspacing="0" cellpadding="5" | ||
|+ | |||
|'''value (hex)''' | |'''value (hex)''' | ||
|'''code (binary)''' | |'''code (binary)''' | ||
| Line 315: | Line 317: | ||
This tree describes literal values for ASCII mode, which adds another compression step to the algorithm. | This tree describes literal values for ASCII mode, which adds another compression step to the algorithm. | ||
{|border="1" | {| border="1" cellspacing="0" cellpadding="5" | ||
|+ | |||
|'''value (hex)''' | |'''value (hex)''' | ||
|'''code (binary)''' | |'''code (binary)''' | ||