title: Symbolic substitution system for data compression.
abstract: A new application of symbolic substitution is presented for string matching with the goal of data compression. A temporal sequence of input symbols is mapped onto a two-dimensional array that contains a tree structure, which in turn is mapped into another array for string generation. A symbolic substitution system and the necessary rules are developed to implement the mapping of the input mapping and the generation of an output sequence. A nonadaptive scheme of compression and decompression is described first, followed by an adaptive scheme with additional rules for the dynamic adaptation process.
authors.forename: S D
authors.initials: SD
authors.lastname: Goodman
authors.forename: M A
authors.initials: MA
authors.lastname: Brooke