toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
Investigation of block-sorting of multiset permutations 1
Authors:
Ziya Arnavut a;
Meral Arnavut a
| Affiliation: | a Department of Mathematics and Computer Science, SUNY Fredonia, NY, USA |
DOI:
10.1080/00207160410001712279
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
81,
Issue
10
October
2004
, pages 1213
- 1222
International Journal of Computer Mathematics,
Volume
81,
Issue
10
October
2004
, pages 1213
- 1222
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 23
Formats available:
HTML
(English)
:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
View Article (HTML)
Abstract
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.
|
|
1
* Some sections of this work have been presented at two different meetings of the IEEE Data Compression Conference, DCC-1998 and DCC-2002.
|
| Keywords: Block-sorting; BWT transformation; Multiset permutations; Lossless compression |
| view references (23) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
