Modeling for text compression
作者： Timothy Bell , Ian H. Witten , John G. Cleary
DOI: 10.1145/76894.76896
关键词:
摘要: … Then both the encoder and decoder update their models in … model to the encoder since it uses exactly the same algorithm to … Usually each variation is an improvement on an earlier one, …
acm.org
sci-hub.se 参考文章(95)
Michael Gates Roberts, Local order estimating Markovian analysis for noiseless source coding and authorship identification ,(1982)
Richard P. Brent, A Linear Algorithm for Data Compression. Australian Computer Journal. ,vol. 19, pp. 64- 68 ,(1987)
Thomas G. Evans, Grammatical Inference Techniques in Pattern Analysis SEN Report Series Software Engineering. ,vol. 2, pp. 183- 202 ,(1971) , 10.1016/B978-0-12-696202-4.50018-8
Timothy Bell, None, A unifying theory and improvements for existing approaches to text compression University of Canterbury. Computer Science. ,(1986) , 10.26021/2003
Richard Clark Pasco, Source coding algorithms for fast data compression ,(1976)
Gilbert Held, Data compression: Techniques and applications : hardware and software considerations ,(1987)
James A. Storer, Data compression: methods and theory Computer Science Press, Inc.. ,(1987)
Thomas J. Lynch, Data compression techniques and applications ,(1985)
M. Guazzo, A general minimum-redundancy source-coding algorithm IEEE Transactions on Information Theory. ,vol. 26, pp. 15- 25 ,(1980) , 10.1109/TIT.1980.1056143
Jon Louis Bentley, Daniel D. Sleator, Robert E. Tarjan, Victor K. Wei, A locally adaptive data compression scheme Communications of The ACM. ,vol. 29, pp. 320- 330 ,(1986) , 10.1145/5684.5688