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

Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented. These algorithms are asymptotically optimal for infinite-length sequences, stationary ergodic sources in the almost-sure sense, and asymptotically...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 48; číslo 9; s. 2621 - 2625
Hlavní autor: Muramatsu, J.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.09.2002
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Codes
Data compression
Redundancy
Sequences
Source coding
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Bounds on the redundancy of the recency-rank and block-sorting universal lossless data compression algorithms for finite-length sequences are presented. These algorithms are asymptotically optimal for infinite-length sequences, stationary ergodic sources in the almost-sure sense, and asymptotically mean stationary sources in the average and almost-sure sense.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2002.801477