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

作者:
PE BenderJK Wolf

关键词:
data compression encoding Lempel-Ziv algorithm Lempel-Ziv-Welch algorithm asymptotic bounds data compression software implementation Artificial intelligence Data compression Encoding

摘要:
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.

在线下载

相关文章:
在线客服:
对外合作:
联系方式:400-6379-560
投诉建议:feedback@hanspub.org
客服号

人工客服,优惠资讯,稿件咨询
公众号

科技前沿与学术知识分享