Investigation of block-sorting of multiset permutations 1

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 th...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics 2004-10, Vol.81 (10), p.1213-1222
Main Authors: Arnavut, Ziya, Arnavut, Meral
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0020-7160
DOI:10.1080/00207160410001712279