New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm

New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ra...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 37; číslo 3; s. 721 - 729
Hlavní autoři: Bender, P.E., Wolf, J.K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.05.1991
Institute of Electrical and Electronics Engineers
Témata:
Applied sciences
Artificial intelligence
Coding, codes
Data compression
Encoding
Entropy
Exact sciences and technology
Information, signal and communications theory
Lifting equipment
Magnetic recording
Signal and communications theory
Software algorithms
Telecommunications and information theory
Compression ratio
Storage capacity
Coding
Asymptotic behavior
Limit
Algorithm
Information compression
Comparative study
Implementation
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í:New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm. They state and prove some asymptotic bounds on the compression ratio that the improved algorithm achieves. For completeness, they describe the Lempel-Ziv-Welch data compression algorithm presented by T. A. Welch (1984). A software implementation for both the original and the improved Lempel-Ziv algorithms is given, and the algorithms are compared with each other as well as with the Lempel-Ziv-Welch algorithm.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9448
1557-9654
DOI:10.1109/18.79942