首页 | 本学科首页   官方微博 | 高级检索  
     


PPM with the extended alphabet
Authors:Przemys?aw Skibiński
Affiliation:Institute of Computer Science, University of Wroc?aw, Przesmyckiego 20, 51-151 Wroc?aw, Poland
Abstract:In the following paper we propose modification of Prediction by Partial Matching (PPM)—a lossless data compression algorithm, which extends an alphabet, used in the PPM method, to long repeated strings. Usually the PPM algorithm’s alphabet consists of 256 characters only. We show, on the basis of the Calgary corpus [T.C. Bell, J. Cleary, I.H. Witten, Text compression. Advanced Reference Series, Prentice Hall, Englewood Cliffs, New Jersey, 1990], that for ordinary files such a modification improves the compression performance in lower, but not greater than 10, orders. However, for some kind of files, this modification gives much better compression performance than any known lossless data compression algorithm.
Keywords:Lossless data compression   PPM   Prediction by partial matching   Repeated strings
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号