In-place length-restricted prefix coding

Proceedings - String Processing and Information Retrieval: A South American Symposium, SPIRE 1998

Volumn 1998-September, Issue , 1998, Pages 50-59

  Milidiu, R L ^a   Pessoa, A A ^a   Laber, E S ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL;

APPROXIMATIVE METHOD; CODEWORD LENGTH; COMPRESSION SCHEME; DECODING RATES; FAST IMPLEMENTATION; FULL-TEXT RETRIEVALS; SIMPLE METHOD; WORD-BASED MODEL;

CODES (SYMBOLS);

EID: 0002433888     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SPIRE.1998.712982     Document Type: Conference Paper

References (18)

1. J. L. Bentley and A. C.-C. Yao. An almost optimal algorithm for unbounded searching. Information Pro-cessing Letters, 5(3):82-87, Aug. 1976.
2. A. S. Fraenkel and S. T. Klein. Bounding the depth of search trees. The Computer Journal, 36(7):668-678, 1993.
3. R. Gallager. Variations on a theme of human. IEEE Transaction on Information Theory, IT-24(6):668-674, 1978.
4. M. R. Garey. Optimal binary search trees with re-stricted maximal depth. Siam Journal on Computing, 3(2):101-110, June 1974.
5. D. A. Human. A method for the construction of minimum-redundancy codes. In Proc. Inst. Radio Eng., pages 1098-1101, Sept. 1952. Published as Proc. Inst. Radio Eng., volume 40, number 9.
6. E. S. Laber, R. L. Milidiu, and C. J. Lucena. Improv-ing the complexity of warm-up algorithm. Technical Report 20, Departamento de Informatica, PUC-RJ, Rio de Janeiro, Brasil, January 1998.
7. L. L. Larmore and D. S. Hirschberg. A fast algorithm for optimal length-limited Human codes. Journal of the ACM, 37(3):464-473, July 1990.
8. R. L. Milidiu and E. S. Laber. Warm-up algorithm: A lagrangean construction of length restricted hu-man codes. Technical Report 15, Departamento de Informatica, PUC-RJ, Rio de Janeiro, Brasil, January 1996.
9. R. L. Milidiu and E. S. Laber. Improved bounds on the ineciency of length restricted codes. Technical Report 33, Departamento de Informatica, PUC-RJ, Rio de Janeiro, Brasil, January 1997.
10. R. L. Milidiu, A. A. Pessoa, and E. S. Laber. Practi-cal use of the warm-up algorithm on length-restricted codes. In R. Baeza-Yates, editor, Proceedings of the Fourth Latin American Workshop on String Process-ing, volume 8 of International Informatics Series, pages 80-94, Valparaiso, Chile, November 1997. Car-leton University Press
11. A. Moat and J. Katajainen. In-place calculation of minimum-redundancy codes. In S. G. Akl, F. K. H. A. Dehne, J.-R. Sack, and N. Santoro, editors, Algo-rithms and Data Structures, 4th International Work-shop, volume 955 of Lecture Notes in Computer Sci-ence, pages 393-402, Kingston, Ontario, Canada, 16-18 Aug. 1995. Springer.
12. E. S. Moura, G. Navarro, and N. Ziviani. Indexing compressed text. In R. Baeza-Yates, editor, Proceed-ings of the Fourth Latin American Workshop on String Processing, volume 8 of International Informatics Se-ries, pages 95-111, Valparaiso, Chile, November 1997. Carleton University Press.
13. B. Schieber. Computing a minimum-weight k-link path in graphs with the concave Monge property. In Proceedings of the Sixth Annual ACM-SIAM Sym-posium on Discrete Algorithms, pages 405-411, San Francisco, California, 22-24 Jan. 1995.
14. A. Turpin and A. Moat. Practical length-limited coding for large alphabets. The Computer Journal, 38(5):339-347, 1995.
15. A. Turpin and A. Moat. Efficient implementation of the package-merge paradigm for generating length-limited codes. In M. E. Houle and P. Eades, editors, Proceedings of Conference on Computing: The Aus-Tralian Theory Symposium, pages 187-195, Townsville, 29-30 Jan. 1996. Australian Computer Science Com-munications.
16. J. van Leeuwen. On the construction of Human trees. In S. Michaelson and R. Milner, editors, Third International Colloquium on Automata, Languages and Programming, pages 382-410, University of Edin-burgh, 20-23 July 1976. Edinburgh University Press.
17. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520-540, June 1987.
18. J. Zobel and A. Moat. Adding compression to a full-Text retrieval system. Software|Practice and Experi-ence, 25(8):891-903, Aug. 1995.