Cart
Investigation of block-sorting of multiset permutations
- DOI:
- 10.1080/00207160410001712279
pages 1213-1222
Available online: 25 Jan 2007Abstract
A recent development in data compression area is Burrows–Wheeler Compression algorithm (BWCA). Introduced by Burrows and Wheeler, the BWCA achieves compression ratio closer to the best compression techniques, such as partial pattern matching (PPM) techniques, but with a faster execution speed. In this paper, we analyze the combinatorial properties of the Burrows–Wheeler transformation (BWT), which is a block-sorting transformation and an essential part of the BWCA, introduce a new transformation, and delineate the new transformation with the BWT based on the multiset permutations.
Keywords
- Recommend to:
- A friend
First page preview
Details
- Citation information:
- Available online: 25 Jan 2007
Author affiliations
- a Department of Mathematics and Computer Science, SUNY Fredonia, NY, 14063, USA
Librarians
- Librarians' area
- Pricing
- Institutional account
- Access entitlements
- Co-branding
- IP ranges
- Link resolver preferences
- Usage reports