An improved sliding window data compression algorithm based on the Lempel-Ziv data compression algorithm (magnetic recording)

A data compression scheme which can improve the efficiency of the Lempel-Ziv data compression algorithm is presented. The proposed scheme is designed to save bits in specifying the length of the matching string. The scheme specifies the difference between the longest and the next shortest length. Si...

Full description

Saved in:
Bibliographic Details
Published in:GLOBECOM '90 : IEEE Global Telecommunications Conference, 1990, and Exhibition. 'Communications: Connecting the Future' : 2-5 December 1990 pp. 1773 - 1777 vol.3
Main Authors: Bender, P.E., Wolf, J.K.
Format: Conference Proceeding
Language:English
Published: IEEE 1990
Subjects:
Data compression
Dictionaries
Electronic mail
Encoding
Hardware
Lifting equipment
Magnetic memory
Magnetic noise
Magnetic recording
Statistics
ISBN:9780879426323, 0879426322
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A data compression scheme which can improve the efficiency of the Lempel-Ziv data compression algorithm is presented. The proposed scheme is designed to save bits in specifying the length of the matching string. The scheme specifies the difference between the longest and the next shortest length. Since this difference is never greater than the length of the string, and often shorter, this scheme can never be less efficient than the scheme where the length itself is used in the codeword, and it is often more efficient. Curves comparing the compression efficiencies of the improved Lempel-Ziv algorithm, the Lempel-Ziv algorithm, and the Lempel-Ziv-Welch algorithm are given.< >
ISBN:9780879426323
0879426322
DOI:10.1109/GLOCOM.1990.116789