1. Bell, T. C., J. G. Cleary, and I. H. Witten, 1990.
Text Compression,
Prentice-Hall, Englewood Cliffs, NJ.
2. Salomon, D., 2000.
Data Compression: The Complete Reference,
2nd Ed., Springer-Verlag, Berlin/
New York.
3. Levenstein, V. E., 1968. On the redundancy and delay of separable codes for tile natural numbers.
Problems of Cybernetics,
Vol. 20, pp. 173-179.
4. Elias, P., 1975. Universal codeword sets and representations of the integers.
IEEE Transactions on
Information Theory,
Vol. IT-21, No. 2, pp. 194-203, March 1975.
5. Even, S., and M. Rodeh, 1978. Economical encoding of commas between strings.
Communications of
the ACM,
Vol. 21, No. 4, pp. 315-317, April 1978.
6. Bentley, J. L., and A. C. Yao, 1976. An almost optimal solution for unbounded searching.
Processing Letters,
Vol. 5, No. 3, pp. 82-87, August 1976.
7. Rice, R. E, 1979. Some practical universal noiseless coding techniques. Jet Propulsion Laboratory, JPL
Publication 79-22, Pasadena, CA, March 1979.
8. Golomb, S. W., 1966. Run-length encodings.
IEEE Transactions on Information Theory,
Vol. 12,
pp. 399-401.
9. Fiala, E. R., and D. H. Greene, 1989. Data compression with finite windows.
Communications of the
Vol. 32, No. 4, pp. 490-505, April 1989.
10. Vajda, S., 1989.
Fibonacci and Lucas Numbers, and the Golden Section Theory and Applications,
Horwood, Chichester.
11. Apostolico, A., and A. S. Fraenkel, 1987. Robust transmission of unbounded strings using Fibonacci
IEEE Transactions on Information Theory.
Vol. IT-33, pp. 238-245.
12. Fraenkel, A. S., and S. T. Klein, 1996. Robust universal complete codes for transmission and compression.
Discrete Applied Mathematics,
Vol. 64, pp. 31-55.
13. Knuth, D. E., 1997.
The Art of Computer Programming, Vol. 1, Fundamental Algorithms,
3rd ed,
Addison-Wesley, Reading, MA.
14. Fenwick, P. M., 1993. Ziv-Lempel encoding with multi-bit flags. In
Proceedings ofthe Data Compression
Conference, DCC-93,
Snowbird, UT, pp. 138-147, March 1993.
15. Wheeler, D. J., 1995. Private communication. Also "An Implementation of Block Coding," October
1995, privately circulated.
16. Fenwick, P. M., 2002. Variable length integer codes based on the Goldbach conjecture and other additive
IEEE Transactions on Information Theory,
Vol. 48, No. 8, August 2002.
17. Burrows, M., and D. J. Wheeler, 1994. A block-sorting lossless data compression algorithm, SRC
Research Report 124, Digital Systems Research Center, Palo Alto, CA, May 1994. Available at,
ftp://gatekeeper.dec.com/pub/DEC/SRC/research-reports/SRC- 124.ps.Z.

Get Lossless Compression Handbook now with the O’Reilly learning platform.

O’Reilly members experience live online training, plus books, videos, and digital content from nearly 200 publishers.