Skeleton trees for the efficient decoding of huffman encoded texts

Information Retrieval

Volumn 3, Issue 1, 2000, Pages 7-23

  Klein, Shmuel T ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Canonical huffman codes; Decoding 2000 kluwer academic publishers; Huffman trees; Skeleton trees

Indexed keywords

EID: 0043122274     PISSN: 13864564     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009910017828     Document Type: Article

References (31)

1. Bell TC, Moffat A, Nevill-Manning CG, Witten IH and Zobel J (1993) Data compression in full-text retrieval systems. Journal ASIS, 44:508-531.
2. Bookstein A and Klein ST (1990) Compression, information theory and grammars: A unified approach. ACM Trans, on Information Systems, 8:27-49.
3. Bookstein and Klein ST (1993) Is Huffman coding dead? Computing, 50:279-296.
4. Bookstein A, Klein ST and Ziff DA (1992) A systematic approach to compressing a full text retrieval system. Information Processing & Management, 28:795-806.
5. Choueka Y, Klein ST and Perl Y (1985) Efficient variants of Huffman codes in high level languages. In: Proc. 8-th ACM-SIGIR Conf., Montreal, pp. 122-130.
6. de Moura ES, Navarro G, Ziviani N and Baeza-Yates R (1998) Fast searching on compressed text allowing errors. In: Proc. 21-st ACM-SIGIR Conf., Melbourne, Australia, pp. 295-306.
7. Ferguson TJ and Rabinowitz JH (1984) Self-synchronizing Huffman codes. IEEE Trans, on Information Theory. IT-30:687-693.
8. Fraenkel AS (1976) All about the Responsa Retrieval Project you always wanted to know but were afraid to ask, expanded summary. Jurimetrics J., 16:149-156.
9. Fraenkel AS and Klein ST (1985) Novel compression of sparse bit-strings. In: Combinatorial Algorithms on Words, Springer Verlag, Berlin, pp. 169-183. NATO ASI Series, Vol. F12.
10. Fraenkel AS and Klein ST (1990) Bidirectional Huffman coding. The Computer Journal, 33:296-307.
11. Fraenkel AS and Klein ST (1993) Bounding the depth of search trees. The Computer Journal, 36:668-678.
12. Gilbert EN and Moore EF (1959) Variable-length binary encodings. The Bell System Technical Journal, 38:933-968.
13. Heaps HS (1978) Information Retrieval, Computational and Theoretical Aspects. Academic Press, New York.
14. Hirschberg DS and Lelewer DA (1990) Efficient decoding of prefix codes. Comm. of the ACM, 33:449-459.
15. Huffman D (1952) A method for the construction of minimum redundancy codes. Proc. of the IRE, 40:1098-1101.
16. Katona GHO and Nemetz TOH (1965) Huffman codes and self-information. IEEE Trans, on Inf. Th., IT-11:284-292.
17. Klein ST, Bookstein A and Deerwester S (1989) Storing text retrieval systems on CD-ROM: Compression and encryption considerations. ACM Trans, on Information Systems, 7:230-245.
18. Knuth DE (1973) The Art of Computer Programming, Vol. I: Fundamental Algorithms. Addison-Wesley, Reading, MA.
19. Lelewer DA and Hirschberg DS (1987) Data compression. ACM Computing Surveys, 19:261-296.
20. Longo G and Galasso G (1982) An application of informational divergence to Huffman codes. IEEE Trans, on Inf. Th., IT-28:36-43.
21. Moffat A and Bell T (1995) In-situ generation of compressed inverted files. J. ASIS, 46:537-550.
22. Moffat A and Turpin A (1997) On the implementation of minimum redundancy prefix codes. IEEE Trans, on Communications, 45:1200-1207.
23. Moffat A, Turpin A and Katajainen J (1995) Space-efficient construction of optimal prefix codes. In: Proc. Data Compression Conference DCC-95, Snowbird, Utah, pp. 192-201.
24. Moffat A, Zobel J and Sharman N (1997) Text compression for dynamic document databases. IEEE Transactions on Knowledge and Data Engineering, 9:302-313.
25. Schwartz ES and Kallick B (1964) Generating a canonical prefix encoding. Comm. of the ACM, 7:166-169.
26. Sieminski A (1988) Fast decoding of the Huffman codes. Information Processing Letters, 26:237-241.
27. Witten IH, Moffat A and Bell TC (1994) Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold, New York.
28. Zipf GK (1935) The Psycho-Biology of Language. Boston, Houghton.
29. Ziv J and Lempel A (1977) A universal algorithm for sequential data compression. IEEE Trans, on Inf. Th., IT-23:337-343.
30. Ziv J and Lempel A (1978) Compression of individual sequences via variable-rate coding. IEEE Trans, on Inf. Th., IT-24:530-536.
31. Zobel J and Moffat A ( 1995) Adding compression to a full-text retrieval system. Software - Practice & Experience, 26:891-903.