Algorithm BSTW

From Wikipedia, the free encyclopedia

This article or section relies largely or entirely upon a single source.
Please help improve this article by introducing appropriate citations of additional sources.

This article needs additional citations for verification.
Please help improve this article by adding reliable references. Unsourced material may be challenged and removed. (May 2008)

This article is orphaned as few or no other articles link to it.
Please help introduce links in articles on related topics. (May 2008)

The Algorithm 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.