Error Resilient Lempel-Ziv Data Compression Scheme with Perfect Hashing

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/6415

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/6415

题名:	Error Resilient Lempel-Ziv Data Compression Scheme with Perfect Hashing
作者:	Chang, C. C.;Tseng, S. W.
关键词:	Lempel-Ziv code;Error resilient;k-error protocol;Perfect hashing
日期:	2008-03
上传时间:	2009-12-17 06:57:50 (UTC+0)
出版者:	Asia University
摘要:	Storer and Reif have studied the error resilient Lempel-Ziv code and shown that it gives protection against error propagation. They left an open problem in the error resilient Lempel-Ziv algorithm with k-error protocol. The algorithm uses hash function to eliminate the dependence between addresses in the dictionary. But hash conflicts affect the compression performance. In this paper, we have implemented a k-error protocol Lempel-Ziv algorithm with perfect hashing. By using a simple perfect hashing scheme, the hash conflicts can be easily removed and the compression performance can be improved. Experimental results also show that our algorithm can enhance the compression performance of the error resilient Lempel-Ziv code.
關聯:	International Journal of Innovative Computing, Information and Control 4( 3):761-770
显示于类别:	[資訊工程學系] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	563	检视/开启
310904400-6415.doc		32Kb	Microsoft Word	287	检视/开启

在ASIAIR中所有的数据项都受到原著作权保护.