next up previous
Next: Run-length Encoding Up: Lossless Compression Algorithms (Repetitive Previous: Lossless Compression Algorithms (Repetitive

Simple Repetition Suppresion

If in a sequence a series on n successive tokens appears we can replace these with a token and a count number of occurences. We usually need to have a special flag to denote when the repated token appears

For Example

89400000000000000000000000000000000

we can replace with

894f32

where f is the flag for zero.

Compression savings depend on the content of the data.

Applications of this simple compression technique include:



Dave Marshall
10/4/2001