Optimal prefix codes for sources with two-sided geometric distributions

IEEE Transactions on Information Theory

Volumn 46, Issue 1, 2000, Pages 121-135

  Merhav, Neri ^a,b   Seroussi, Gadiel ^a,b   Weinberger, Marcelo J ^b  

^a IEEE

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DECISION THEORY; HEURISTIC METHODS; IMAGE CODING; IMAGE COMPRESSION; MATHEMATICAL MODELS; PROBABILITY;

EXPONENTIAL DISTRIBUTION; GEOMETRIC DISTRIBUTIONS; GOLOMB CODES; HUFFMAN CODE;

CODES (SYMBOLS);

EID: 0033899912     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.817513     Document Type: Article

References (20)

1. A. Netravali and J. O. Limb, "Picture coding: A review," Proc. IEEE, vol. 68, pp. 366-406, 1980.
2. J. O'Neal, "Predictive quantizing differential pulse code modulation for the transmission of television signals," Bell Syst. Tech. J., vol. 45, pp. 689-722, May 1966.
3. M. J. Weinberger, G. Seroussi, and G. Sapiro, "The LOCO-I lossless image compression algorithm: Principles and standardization into JPEG-LS," Hewlett-Packard Labs., Palo Alto, CA, Hewlett-Packard Laboratories Tech. Rep. HPL-98-193, 1998.
4. X. Wu and N. D. Memon, "Context-based, adaptive, lossless image coding," IEEE Trans. Commun., vol. 45, no. 4, pp. 437-444, Apr. 1997.
5. M. J. Weinberger, J. Rissanen, and R. Arps, "Applications of universal context modeling to lossless compression of gray-scale images," IEEE Trans. Image Processing, vol. 5, pp. 575-586, Apr. 1996.
6. M. J. Weinberger, G. Seroussi, and G. Sapiro, "LOCO-I: A low complexity, context-based, lossless image compression algorithm," in Proc. 1996 Data Compression Conf., Snowbird, UT, USA, Mar. 1996, pp. 140-149.
7. J. Rissanen, "Universal coding, information, prediction, and estimation," IEEE Trans. Inform. Theory, vol. IT-30, pp. 629-636, July 1984.
8. N. Merhav, G. Seroussi, and M. J. Weinberger, "Coding for sources with two-sided geometric distributions and unknown parameters," IEEE Trans. Inform. Theory, vol. 46, pp. 00-000, Jan. 2000.
9. T. Linder, V. Tarokh, and K. Ze ger, "Existence of optimal prefix codes for infinite source alphabets," IEEE Trans. Inform. Theory, vol. 43, pp. 2026-2028, Nov. 1997.
10. A. Kato, T. S. Han, and H. Nagaoka, "Hoffman coding with an infinite alphabet," IEEE Trans. Inform. Theory, vol. 42, pp. 977-984, May 1996.
11. S. W. Golomb, "Run-length encodings," IEEE Trans. Inform. Theory, vol. IT-12, pp. 399-401, July 1966.
12. R. Gallager and D. V. Voorhis, "Optimal source codes for geometrically distributed integer alphabets," IEEE Trans. Inform. Theory, vol. IT-21, pp. 228-230, Mar. 1975.
13. R. F. Rice, "Some practical universal noiseless coding techniques-Parts I-III," Jet Propulsion Laboratory, Pasadena, CA, Tech. Rep. JPL-79-22, JPL-83-17, and JPL-91-3, Mar., Mar., and Nov.; 1979, 1983, and 1991.
14. P. G. Howard and J. S. Vitter, "Fast and efficient lossless image compression," in Proc. 1993 Data Compression Conf., Snowbird, UT, USA, Mar. 1993, pp. 351-360.
15. D. E. Knuth, "Dynamic Huffman coding," J. Algorithms, vol. 6, pp. 163-180, 1985.
16. G. Seroussi and M. J. Weinberger, "On adaptive strategies for an extended family of Golomb-type codes," in Proc. 1997 Data Compression Conf., Snowbird, UT, USA, Mar. 1997, pp. 131-140.
17. K.-M. Cheung and P. Smyth, "A high-speed distortionless predictive image compression scheme," in Proc. 1990 Int. Symp. Information Theory and Its Applications, Honolulu, HI, USA, Nov. 1990, pp. 467-470.
18. J. Abrahams, "Huffman-type codes for infinite source distributions," J. Franklin Inst., vol. 331B, no. 3, pp. 265-271, 1994.
19. P. A. Humblet, "Optimal source coding for a class of integer alphabets," IEEE Trans. Inform. Theory, vol. IT-24, pp. 110-112, Jan. 1978.
20. S. W. Golomb, "Sources which maximize the choice of a Huffman coding tree," Inform. Contr., vol. 45, pp. 263-272, June 1980.