Share via

3.2.3 Maximum Compression Example

  • Article

The following illustrates a set of repeating characters that represent a string that can be maximally compressed using the compression algorithm. 

 aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

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 03 B0 02 61 45 00

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

 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 
 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 
 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 
 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 61 
 61 61 61 61 61 61 61 61 61