NEW ASYMPTOTIC BOUNDS AND IMPROVEMENTS ON THE LEMPEL-ZIV DATA-COMPRESSION ALGORITHM

被引：19

作者：

BENDER, PE

WOLF, JK

机构：

[1] Center for Magnetic Recording Research, University of California, San Diego, La Jolla, CA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1991年 / 37卷 / 03期

基金：

美国国家科学基金会;

关键词：

asymptotic; compression ratio; data compression; entropy; Lempel-Ziv;

D O I：

10.1109/18.79942

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Recently, there has been an interest in increasing the capacity of storage systems through the use of information lossless data compression. Several algorithms are being investigated and implemented. One such algorithm is the Lempel-Ziv data compression algorithm. A new data compression algorithm is presented based on the original Lempel-Ziv algorithm and bounds are derived showing the improved Lempel-Ziv algorithm's performance as compared to the original Lempel-Ziv algorithm's performance. In addition, both algorithms are implemented in software and are compared with each other as well as with the Lempel-Ziv-Welch data compression algorithm.

引用

页码：721 / 729

页数：9

共 10 条

[1]

HUFFMAN DA, 1978, IEEE T INFORM THEORY, V24, P668

[2]

ORNSTEIN DS, ENTROPY DATA COMPRES

[3] UNIVERSAL MODELING AND CODING [J].