A unifying theory and improvements for existing approaches to text compression
作者： Timothy Bell , None
DOI: 10.26021/2003
关键词: Information retrieval 、 Computer science 、 Text compression
摘要:
canterbury.ac.nz
sci-hub.st 参考文章(54)
Michael Gates Roberts, Local order estimating Markovian analysis for noiseless source coding and authorship identification ,(1982)
Ian H. Witten, John G. Cleary, Fortelling the future by adaptive modeling Abacus. ,vol. 3, pp. 16- 36 ,(1986) , 10.1007/978-1-4419-8726-6_10
Richard Y. Kain, Automata theory: Machines and languages ,(1981)
Steve A. Money, Teletext and Viewdata ,(1979)
Richard Clark Pasco, Source coding algorithms for fast data compression ,(1976)
Charles P. Bourne, Donald F. Ford, A Study of Methods for Systematically Abbreviating English Words and Names Journal of the ACM. ,vol. 8, pp. 538- 552 ,(1961) , 10.1145/321088.321094
M.A. Bassiouni, Data Compression in Scientific and Statistical Databases IEEE Transactions on Software Engineering. ,vol. SE-11, pp. 1047- 1058 ,(1985) , 10.1109/TSE.1985.231852
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, Andrew Chi-Chih Yao, An almost optimal algorithm for unbounded searching Information Processing Letters. ,vol. 5, pp. 82- 87 ,(1976) , 10.1016/0020-0190(76)90071-5
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