Improved redundancy of a version of the Lempel-Ziv algorithm

The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy /spl rho//sub n/ (defined as the difference between the average code rate and the entropy when the memory size is n) is O (log log n/log n). We suggest a new version of the algorithm with redunda...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on information theory Ročník 41; číslo 3; s. 723 - 731
Hlavní autori: Wyner, A.D., Wyner, A.J.
Médium: Journal Article Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.05.1995
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Applied sciences
Coding, codes
Data compression
Decoding
Encoding
Entropy
Exact sciences and technology
Information technology
Information theory
Information, signal and communications theory
Signal and communications theory
Statistics
Telecommunications and information theory
Zirconium
Entropy
Coding
Redundancy
Data compression
ISSN:0018-9448, 1557-9654
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy /spl rho//sub n/ (defined as the difference between the average code rate and the entropy when the memory size is n) is O (log log n/log n). We suggest a new version of the algorithm with redundancy /spl rho//sub n/=O (1/log n).< >
Bibliografia: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/18.382018