On the usefulness of fibonacci compression codes

Computer Journal

Volumn 53, Issue 6, 2010, Pages 701-716

  Klein, Shmuel T ^a   Ben Nissan, Miri Kopel ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Dense codes; Fibonacci codes; Text compression

Indexed keywords

BINARY REPRESENTATIONS; COMPRESSION CODES; COMPRESSION EFFICIENCY; DENSE CODES; FIBONACCI CODES; FIBONACCI NUMBERS; TEXT COMPRESSIONS; VARIABLE LENGTH CODES;

COMPUTER SCIENCE;

NUMBER THEORY;

EID: 79955714647     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxp046     Document Type: Article

References (27)

1. Manber, U. (1997) A text compression scheme that allows fast searching directly in the compressed file. ACM Trans. Inf. Sys. 15, 124-136.
2. Farach, M. and Thorup, M. (1998) String matching in Lempel-Ziv compressed strings. Algorithmica, 20, 388-404.
3. de Moura, E.S., Navarro, G., Ziviani, N. and Baeza-Yates R. (2000) Fast and flexible word searchingon compressed text. ACM Trans. Inf. Syst., 18, 113-139.
4. Brisaboa, N.R., Fariña, A., Navarro, G. and Paramá J.R. (2005) Efficiently Decodable and Searchable Natural Language Adaptive Compression. Proc. 28th ACM-SIGIR Conf., Salvador, Brazil, August 15-19, pp. 234-241. ACM, New York.
5. Moffat, A. (1989) Word-based text compression. Softw.-Pract. Exp. 19, 185-198.
6. Klein, S.T. and Shapira, D. (2005) Pattern matching in Huffman encoded texts. Inf. Process. Manage., 41, 829-841.
7. Biskup, M.T. (2008) Guaranteed Synchronization of Huffman Codes. Proc. Data Compression Conf. DCC-2008, Snowbird, Utah, March 15-17, pp. 462-471. IEEE Computer Society, Los Alamitos, CA.
8. Brisaboa, N.R., Iglesias, E.L., Navarro, G. and Paramá J.R. (2003)An Efficient Compression Code for Text Databases, Proc. European Conf. Information Retrieval ECIR'03, Pisa, Italy, April 14-16, Lecture Notes in Computer Science 2633, pp. 468-481. Springer, Berlin.
9. Brisaboa, N.R., Fariña, A., Navarro, G. and Esteller M.F. (2003) (s, c)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases. Proc. Symp. String Processing and Information Retrieval SPIRE'03, Manaus, Brazil, October 8-10, Lecture Notes in Computer Science 2857, pp. 122-136. Springer, Berlin.
10. Apostolico, A. and Fraenkel, A.S. (1987) Robust transmission of unbounded strings using Fibonacci representations. IEEE Trans. Inf. Theory, 33, 238-245.
11. Fraenkel, A.S. and Klein, S.T. (1996) Robust universal complete codes for transmission and compression. Discrete Appl. Math., 64, 31-55.
12. Przywarski, R., Grabowski, S., Navarro, G. and Salinger, A. (2006) FM-KZ: An Even Simpler Alphabet-Independent FM-Index, Proc. Prague Stringology Conf., Prague, Czech Republic, August 28-30, pp. 226-240. Czech Technical University, Prague.
13. Lelewer, D.A. and Hirschberg, D.S. (1987) Data compression. ACM Comput. Surv., 19, 261-296.
14. Klein, S.T. (2000) Skeleton trees for the efficient decoding of Huffman encoded texts. Kluwer J. Inf. Retr., 3, 7-23.
15. Liddell, M. and Moffat, A. (2006) Decoding prefix codes. Softw.-Pract. Exp., 36, 1687-1710.
16. Bookstein, A. and Klein, S.T. (1993) Is Huffman coding dead? Computing, 50, 279-296.
17. Moffat, A., Zobel, J. and Sharman, N. (1997) Text compression for dynamic document databases. IEEETrans. Knowl. Data Eng., 9, 302-313.
18. Zipf, G.K. (1935) The Psycho-Biology of Language. Houghton Mifflin, Boston, MA.
19. Bookstein, A., Klein, S.T. and Ziff, D.A. (1992) A systematic approach to compressing a full text retrieval system. Inf. Process. Manage., 28, 795-806.
20. Fraenkel, A.S. (1976) All about the Responsa Retrieval Project you always wanted to know but were afraid to ask, Expanded Summary. Jurimetr. J., 16, 149-156.
21. Bergman, E. and Klein, S.T. (2005) Fast Decoding of Prefix Encoded Texts. Proc. Data Compression Conf. DCC-2005, Snowbird, Utah, March 29-31, pp. 143-152. IEEE Computer Society, Los Alamitos, CA.
22. Brisaboa, N.R., Fariña, A., Navarro, G. and Paramá J.R. (2007) Lightweight natural language text compression. Inf. Retr., 10, 1-33.
23. Choueka, Y., Klein, S.T. and Perl Y. (1985) Efficient Variants of Huffman Codes in High Level Languages. Proc. 8th ACM-SIGIR Conf., Montreal, Canada, June 5-7, pp. 122-130. ACM, New York.
24. Sieminski, A. (1988) Fast decoding of Huffman codes. Inf. Process. Lett., 26, 237-241.
25. Véronis, J. and Langlais, P. (2000) Evaluation of Parallel Text Alignment Systems: The Arcade Project. In Véronis, J. (ed), Parallel Text Processing, pp. 369-388. Kluwer Academic Publishers, Dordrecht.
26. Boyer, R.S. and Moore, J.S. (1977) A fast string searching algorithm. Commun. ACM, 20, 762-772.
27. Klein, S.T. and Kopel Ben-Nissan M. (2007) Accelerating Boyer-Moore Searches on Binary Texts. Proc. Intern. Conf. Implementation and Application of Automata, CIAA-07, Prague, Czech Republic, July 16-18, Lecture Notes in Computer Science 4783, pp. 130-143. Springer, Berlin.