Jump to content

Algorithm BSTW

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 67.39.112.238 (talk) at 00:17, 11 January 2006 (Add a basic summary of BSTW from the referenced page.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Algorithmm BSTW is a data compression algorithm, named after its designers, Bentley, Sleator, Tarjan and Wei in 1986. BSTW is a dictionary-based algorithm that uses a move-to-front transform to keep recently-seen dictionary entries at the front of the dictionary. Dictionary references are then encoded using any of a number of encoding methods, usually Elias delta coding or Elias gamma coding.

References