A multi-tree automation for efficient data transmission
K. A. Hazboun, J. L. Raymond · Statistical and Scientific Database Management · 1983
A two-stage finite state implementation of an efficient compression algorithm is outlined. This design is proposed for the economic transmission of large volume of data within a distributed network of statistical databases. The encoder/decoder stage of the design is based on a reversible semantic-independent variable-length character technique that makes use of the group locality of character reference behavior and the variable frequency of character occurrence within a well-defined subgroupings of the character set. The two-stage automata, while specifically designed for a modified version of the Hazboun-Bassiouni Multi-Group algorithm, is extended to support any single character look-ahead procedure.