On the performance of recency-rank and block-sorting universal lossless data compression algorithms

IEEE Transactions on Information Theory

Volumn 48, Issue 9, 2002, Pages 2621-2626

  Muramatsu, Jun ^a,b  

^a IEEE   (Japan)

^b NTT Communication Science Laboratories   (Japan)

Author keywords

Block sorting algorithm; Book stack algorithm; Burrows Wheeler transform; Lossless data compression; Move to front algorithm; Recency rank algorithm; Universal code

Indexed keywords

BLOCK SORTING ALGORITHM; BURROWS-WHEELER TRANSFORM; LOSSLESS DATA COMPRESSION; RECENCY RANK ALGORITHM; UNIVERSAL CODE;

ALGORITHMS; CODES (SYMBOLS); DATA COMPRESSION; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; REDUNDANCY;

INFORMATION THEORY;

EID: 0036712205     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.801477     Document Type: Letter

References (16)

1. Information theoretic analysis of block sorting data compression method
2. Asymptotic optimality of the block sorting data compression algorithm
3. Almost sure convergence coding theorem for block sorting data compression algorithm
4. A block-sorting lossless data compression algorithm
5. A locally adaptive data compression scheme
6. Universal lossless source coding with the burrows wheeler transform
7. Universal codeword sets and representations of the integers
8. Interval and recency rank source coding: Two on-line adaptive variable-length schemes
9. Entropy and data compression schemes
10. Book stack data compression
11. Universal data compression and repetition times
12. Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
13. Compression of individual sequences via variable-rate coding