Category : C Source Code
Archive   : SPLINT.ZIP
Filename : SPLINT.1ST

Splint: a data compression program
Beta-release version 2.1
Programmed by Kenji Rikitake
Modified and tuned for Microsoft C by Naoshi Wakatabe
Original algorithm innovated by Douglas W. Jones
Copyright (C)1988, 1989 by Kenji Rikitake and Naoshi Wakatabe.
All rights reserved.
Permission to copy this program without fee all or part of this
material is granted, provided that the copies are not made or
distributed for direct commercial advantage.

If you have any questions and/or suggestions, Contact

Kenji Rikitake
4-19-11-102, Sakurajousui, Setagaya-ku,
Tokyo 156 Japan

DASnet/TWICS: [email protected]
JUNET: rikitake%[email protected]

Splint is a Huffman-coding-basis data compression/decompression
program, based on Jones' idea of using splay-prefix scheme.
For further details, refer to:

Jones, Douglas. W,:
Application of Splay Trees to Data Compression,
Communications ACM, Vol. 31, No. 8, pp. 996 - 1007. (August 1988)

This program uses 64-state Markov model to improve compression rate.
Usually this program works as better as pkarc Crunching. Sometimes,
it gives a little bit better result than UNIX compress uses 16bit LZW.

I want to get this method and LZSS together, and make this better than
LHarc. 🙂

This program runs on MS-DOS. You can recompile it on 4.xBSDs using
makefile.bsd. I have tested this on my NEC PC-9801UV2 computer
(MS-DOS 3.21) and Sun-4/110 with SunOS 4.0.

Acknowledgements:
Douglas Jones for his simple and fast algorithm.
Naoshi Wakatabe for making this program run on MS-C small model.

-- Kenji Rikitake, April 12, 1989 at Tokyo