DHPC

DHPC stands for Dynamic History Predictive Compression. It was created in late 1986 and later published as the paper:

Williams, R.N., "Dynamic-History Predictive Compression", Information Systems , 13(1), pp.129-140, 1988.

The algorithm is also discussed in detail in Chapter 2 of my Ph.D. Thesis which was published as a book (which you can purchase online). DHPC was my first data compression algorithm (apart from some early tinkering with run-length coding) and assumed a complete separation between prediction and coding (the modern paradigm of data compression).

The algorithm is a text compression algorithm that employs a variable-order Markov model that grows a backwards tree structure and uses fixed occurance thresholds to control tree growth and prediction node choice. DHPC is a strict subset of the SAKDC algorithm. DHPC does not define a coder, but can be used with a variety of coders. It will perform best with arithmetic coding.

Implementations of DHPC are not available.