An empirical evaluation of coding methods for multi-symbol alphabets

Data Compression Conference Proceedings

Volumn , Issue , 1993, Pages 108-117

  Moffat, Alistair ^a   Sharman, Neil ^a   Witten, Ian H ^b   Bell, Timothy C ^c  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF WAIKATO   (New Zealand)

^c UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

DATA COMPRESSION; DIGITAL ARITHMETIC;

ARITHMETIC CODING; CODING METHODS; COMPRESSION EFFICIENCY; DYNAMIC HUFFMAN CODING; EMPIRICAL EVALUATIONS; HUFFMAN CODING; LARGE ALPHABETS; RESOURCE REQUIREMENTS;

CODES (SYMBOLS);

EID: 85057439633     PISSN: 10680314     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DCC.1993.253139     Document Type: Conference Paper

References (22)

1. T.C. BELL, J.G. CLEARY, AND I.H. WITTEN. Text Compression. Prentice-Hall, 1990.
2. A. BOOKSTEIN AND S.T. KLEIN. IS Huffman coding dead? In Proc. DCC, 1993.
3. D. CHEVION, E.D. KARNIN, AND E. WALACH. High efficiency, multiplication free approximation of arithmetic coding. In Proc. DCC, pages 43-52, 1991.
4. J.G. CLEARY AND I.H. WITTEN. Data compression using adaptive coding and partial string matching. IEEE Tr. Comm., COM-32:396-402, 1984.
5. G.V. CORMACK AND R.N. HORSPOOL. Algorithms for adaptive Huffman codes. Inf. Proc. Lett, 18:159-165, 1984.
6. N. FALLER. An adaptive system for data compression. In Proc. 7'th Asilomar Conf. Circuits, Systems, and Computers, pages 593-597, 1973.
7. R.G. GALLAGER. Variations on a theme by Huffman. IEEE Tr. Inf. Th., IT-24:668-674,1978.
8. D. HIRSCHBERG AND D. LELEWER. Efficient decoding of prefix codes. C. ACM, 33:449-459, 1990.
9. P.G. HOWARD AND J.S. VITTER. Practical implementations of arithmetic coding. In Image and Text Compression, pages 85-112. Kluwer Academic, Norwell, Massachusetts, 1992.
10. D.A. HUFFMAN. A method for the construction of minimum redundancy codes. Proc. IRE, 40:1098-1101, 1952.
11. D. JONES. Application of splay trees to data compression. C. ACM, 31:996-1007, 1988.
12. D. KNUTH. Dynamic Huffman coding. J. Alg., 6:163-180, 1985.
13. G.G. LANGDON. Probabilistic and Q-coder algorithms for binary source adaptation. In Proc. DCC, pages 13-21, 1991.
14. D. LELEWER AND D. HIRSCHBERG. Data compression. Comp. Surv., 19:261-296, 1987.
15. A. MOFFAT. Implementing the PPM data compression scheme. IEEE Tr. Comm., 38:19171921, 1990.
16. A. MOFFAT. Linear time adaptive arithmetic coding. IEEE Tr. Inf. Th., 36:401-406, 1990.
17. R.M. NEAL. Fast arithmetic coding using low-precision division. Manuscript, 1987. Code implementing this method is available by anonymous ftp from isa.cpsc.ucalgary.ca.
18. J. RISSANEN AND K.M. MOHUIDDIN. A multiplication-free multialphabet arithmetic code. IEEE Tr. Comm., 37:93-98, 1989.
19. J.S. VITTER. Design and analysis of dynamic Huffman codes. J. ACM, 1987.
20. J.S. VITTER. Algorithm 673: Dynamic Huffman coding. ACM TOMS, 15:158-167,1989.
21. I.H. WITTEN AND T.C. BELL. The zero frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Tr. Inf. Th., 37:1085-1094, 1991.
22. I.H. WITTEN, R. NEAL, AND J.G. CLEARY. Arithmetic coding for data compression. C. ACM, 30:520-541, 1987.