Data Compression Using Dynamic Markov Modelling
暂无分享,去创建一个
[1] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[2] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[3] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[4] Robert G. Gallager,et al. Variations on a theme by Huffman , 1978, IEEE Trans. Inf. Theory.
[5] Glen G. Langdon,et al. Arithmetic Coding , 1979 .
[6] Mauro Guazzo,et al. A general minimum-redundancy source-coding algorithm , 1980, IEEE Trans. Inf. Theory.
[7] Kishor S. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .
[8] Dennis G. Severance,et al. A practitioner's guide to data base compression - Tutorial , 1983, Inf. Syst..
[9] Terry A. Welch,et al. A Technique for High-Performance Data Compression , 1984, Computer.
[10] Ian H. Witten,et al. Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..
[11] R. Nigel Horspool,et al. Algorithms for Adaptive Huffman Codes , 1984, Inf. Process. Lett..
[12] Gordon V. Cormack,et al. Data compression on a database system , 1985, CACM.