Efficient multiplication-free arithmetic codes
暂无分享,去创建一个
[1] Shawmin Lei. Finite word-length effects on arithmetic codes , 1993, 1993 IEEE International Symposium on Circuits and Systems.
[2] Ehud D. Karnin,et al. High efficiency, multiplication free approximation of arithmetic coding , 1991, [1991] Proceedings. Data Compression Conference.
[3] Ming-Ting Sun,et al. Design and hardware architecture of high-order conditional entropy coding for images , 1992, IEEE Trans. Circuits Syst. Video Technol..
[4] Jorma Rissanen,et al. Compression of Black-White Images with Arithmetic Coding , 1981, IEEE Trans. Commun..
[5] Glen G. Langdon,et al. A simple general binary source code , 1982, IEEE Trans. Inf. Theory.
[6] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.
[7] Richard Clark Pasco,et al. Source coding algorithms for fast data compression , 1976 .
[8] D. Huffman. A Method for the Construction of Minimum-Redundancy Codes , 1952 .
[9] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[10] Norman Abramson,et al. Information theory and coding , 1963 .
[11] Glen G. Langdon,et al. An Overview of the Basic Principles of the Q-Coder Adaptive Binary Arithmetic Coder , 1988, IBM J. Res. Dev..
[12] Cliff B. Jones. An efficient coding system for long source sequences , 1981, IEEE Trans. Inf. Theory.
[13] Jorma Rissanen,et al. Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..
[14] Jorma Rissanen,et al. A multiplication-free multialphabet arithmetic code , 1989, IEEE Trans. Commun..
[15] Glen G. Langdon,et al. An Introduction to Arithmetic Coding , 1984, IBM J. Res. Dev..
[16] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[17] Yasuhiko Yasuda,et al. Highly efficient entropy coding of multilevel images using a modified arithmetic code , 1991, Other Conferences.