User:MorganHydroponics/sandbox

LZP is a form of dictionary based compression invented by Charles Bloom that uses a function as a prediction mechanism to index into a dictionary, the function is often a special hash function. As with any compression family there are variants, the original paper in which the technique was alluded to (but not fully described) contained four variant, named LZP1 through to LZP4.

The compression technique is simple and can be described in under 60 lines of non-obfuscated C_(programming_language) for both the compression and decompression routines. Due to the algorithms simplicity it lends itself to fast CODECs even for particularly naive implementations.

Dictionary sizes of 256 bytes to the more common 64KiB are common.