Share via

3.2.2 Normal Compression Example

  • Article

The following string illustrates an ASCII text string with a typical set of characters that can be compressed by the compression algorithm. 

 #aaabcdefaaaaghijaaaaaklaaamnopqaaaaaaaaaaaarstuvwxyzaaa

This example is provided to demonstrate the results of compressing and decompressing the example string using an interoperable implementation of the algorithm specified in section 2.4.1.

The following hex array represents the compressed byte array of the example string as compressed by the compression algorithm:

 01 2F B0 00 23 61 61 61 62 63 64 65 82 66 00 70 
 61 67 68 69 6A 01 38 08 61 6B 6C 00 20 6D 6E 6F 
 70 06 71 02 70 04 00 72 73 74 75 76 10 77 78 79 
 7A 00 2C

The following hex array represents the decompressed byte array of the example string as decompressed by the decompression algorithm: 

 23 61 61 61 62 63 64 65  66 61 61 61 61 67 68 69
 6a 61 61 61 61 61 6B 6C  61 61 61 6D 6E 6F 70 71
 61 61 61 61 61 61 61 61  61 61 61 61 72 73 74 75
 76 77 78 79 7A 61 61 61