Optimal prefix codes for sources with two-sided geometric distributions
暂无分享,去创建一个
[1] Jorma Rissanen,et al. Applications of universal context modeling to lossless compression of gray-scale images , 1995, Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers.
[2] J. B. O'Neal,et al. Predictive quantizing systems (differential pulse code modulation) for the transmission of television signals , 1966 .
[3] S. Golomb. Run-length encodings. , 1966 .
[4] R. F. Rice,et al. Some practical universal noiseless coding techniques, part 2 , 1983 .
[5] Guillermo Sapiro,et al. The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS , 2000, IEEE Trans. Image Process..
[6] Padhraic Smyth,et al. A High-Speed Distortionless Predictive Image-Compression Scheme , 1990 .
[7] Robert F. Rice,et al. Some practical universal noiseless coding techniques , 1979 .
[8] Paul G. Howard,et al. Fast and Eecient Lossless Image Compression Fast and Efficient Lossless Image Compression , 1993 .
[9] Te Sun Han,et al. Huffman coding with an infinite alphabet , 1996, IEEE Trans. Inf. Theory.
[10] Solomon W. Golomb,et al. Run-length encodings (Corresp.) , 1966, IEEE Trans. Inf. Theory.
[11] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[12] Pierre A. Humblet,et al. Optimal source coding for a class of integer alphabets (Corresp.) , 1978, IEEE Trans. Inf. Theory.
[13] Solomon W. Golomb. Sources Which Maximize the Choice of a Huffman Coding Tree , 1980, Inf. Control..
[14] Gadiel Seroussi,et al. On adaptive strategies for an extended family of Golomb-type codes , 1997, Proceedings DCC '97. Data Compression Conference.
[15] Vahid Tarokh,et al. Existence of optimal prefix codes for infinite source alphabets , 1997, IEEE Trans. Inf. Theory.
[16] Neri Merhav,et al. Coding of sources with two-sided geometric distributions and unknown parameters , 2000, IEEE Trans. Inf. Theory.
[17] Guillermo Sapiro,et al. LOCO-I: a low complexity, context-based, lossless image compression algorithm , 1996, Proceedings of Data Compression Conference - DCC '96.
[18] Julia Abrahams. Huffman-type codes for infinite source distributions , 1994 .
[19] David C. van Voorhis,et al. Optimal source codes for geometrically distributed integer alphabets (Corresp.) , 1975, IEEE Trans. Inf. Theory.
[20] A.N. Netravali,et al. Picture coding: A review , 1980, Proceedings of the IEEE.
[21] Nasir D. Memon,et al. Context-based, adaptive, lossless image coding , 1997, IEEE Trans. Commun..
[22] Donald E. Knuth,et al. Dynamic Huffman Coding , 1985, J. Algorithms.
[23] P.G. Howard,et al. Fast and efficient lossless image compression , 1993, [Proceedings] DCC `93: Data Compression Conference.