Arithmetic coding for finite-state noiseless channels
暂无分享,去创建一个
[1] Mauro Guazzo,et al. A general minimum-redundancy source-coding algorithm , 1980, IEEE Trans. Inf. Theory.
[2] Jorma Rissanen,et al. Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..
[3] Serap Ayĩe Savari. Source coding for channels with finite-state letter costs , 1991 .
[4] Cliff B. Jones. An efficient coding system for long source sequences , 1981, IEEE Trans. Inf. Theory.
[5] Serap A. Savari,et al. Arithmetic coding for memoryless cost channels , 1992, Data Compression Conference, 1992..
[6] Gerald E. Flueckiger. Information Theory and Coding , 1995 .
[7] Stephen Todd,et al. A General Fixed Rate Arithmetic Coding Method for Constrained Channels , 1983, IBM J. Res. Dev..
[8] Glen G. Langdon,et al. An Introduction to Arithmetic Coding , 1984, IBM J. Res. Dev..
[9] Glen G. Langdon,et al. Arithmetic Coding , 1979 .
[10] Ian H. Witten,et al. Arithmetic coding for data compression , 1987, CACM.
[11] Norman Abramson,et al. Information theory and coding , 1963 .
[12] Imre Csiszár,et al. Simple Proofs of Some Theorems on Noiseless Channels , 1969, Inf. Control..
[13] Richard Clark Pasco,et al. Source coding algorithms for fast data compression , 1976 .