1. Universal modeling and coding
2. A Mathematical Theory of Communication
3. M. Burrows and D. J. Wheeler, “A block-sorting lossless data compression algorithm,” SRC Research Report 124, Digital Systems Research Center, Palo Alto, CA., May 1994. (ftp site: gatekeeper.dec. com, /pub/DEC/SRC/research-reports/SRC-124.ps.Z)
4. J. G. Cleary, W. J. Teahan, and I. H. Witten, “Unbounded length contexts for PPM,”Data Compression ConferenceDCC-95, pp. 52–61, IEEE Computer Science Press, Los Alamitos, CA (1995).
5. P. Fenwick, “Block sorting text compression,”Proceedings of the 19’th Australasian Comp. Science Conference, pp. 193–202 (1996). (ftp site: ftp.cs.auckland.ac.nz, /out/peter-f/ACSC96paper.ps).