Symbolic substitution system for data compression


Journal Article

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. © 1993 Optical Society of America.

Full Text

Duke Authors

Cited Authors

  • Goodman, SD; Brooke, MA

Published Date

  • February 10, 1993

Published In

Volume / Issue

  • 32 / 5

Start / End Page

  • 752 - 760

Electronic International Standard Serial Number (EISSN)

  • 2155-3165

International Standard Serial Number (ISSN)

  • 1559-128X

Digital Object Identifier (DOI)

  • 10.1364/AO.32.000752

Citation Source

  • Scopus