Merge source coding

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 214-218

  Ávila, Bruno T ^a   Laber, Eduardo S ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

CONVERSION FUNCTION; MERGING ALGORITHMS; RANDOM SOURCES; RICE CODING; RUN LENGTH; SOURCE-CODING;

INFORMATION THEORY;

MERGING;

EID: 70449490696     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205774     Document Type: Conference Paper

References (19)

1. C. E. Shannon, "A mathematical theory of communication," The Bell System Technical Journal, vol. 27, pp. 379-423, 623-656, July 1948.
2. J. J. Rissanen and G. G. L. Jr., "Arithmetic coding," IBM Journal of Research and Development, vol. 23, no. 2, pp. 146-162, March 1979.
3. D. A. Huffman, "A method for the construction of minimum-redundancy codes," Proceedings of the IRE, pp. 1098-1101, September 1952.
4. A. Moffat, T. C. Bell, and I. H. Witten, "Lossless compression for text and images," International Journal of High Speed Electronics and Systems, vol. 8, no. 1, pp. 179-231, October 1997.
5. P. Elias, "Universal codeword sets and representations of the integers," IEEE Transactions on Information Theory, vol. IT-21, no. 2, pp. 194-203, January 1975.
6. S. W. Golomb, "Run-length codings," IEEE Transactions on Information Theory, vol. 12, no. 7, pp. 399-401, May 1966.
7. R. F. Rice, "Some practical universal noiseless coding techniques," Jet Propulsion Laboratory, California Institute of Technology, Pasadena, Tech. Rep. 79-22, 1979.
8. J. L. Bentley and A. C. Yao, "An almost optimal algorithm for unbounded searching," Information Processing Letters, vol. 5, no. 3, pp. 82-87, August 1976.
9. F. K. Hwang and S. Lin, "A simple algorithm for merging two disjoint linearly ordered lists," SIAM Journal of Computing, vol. 1, pp. 31-39, 1972.
10. K. Dudzinski and A. Dydek, "On a stable storage merging algorithm," Information Processing Letters, vol. 12, pp. 5-8, 1981.
11. A. Moffat and L. Stuiver, "Binary interpolative coding for effective index compression," Information Retrieval, vol. 3, no. 1, pp. 25-47, 2000.
12. W. F. de La Vega, S. Kannan, and M. Santha, "Two probabilistic results on merging," SIAM Journal of Computing, vol. 22, no. 2, pp. 261-271, April 1993.
13. D. E. Knuth, The Art of Computer Programming: Sorting and Searching. Addison-Wesley, 1973, vol. 3.
14. P. K. Stockmeyer and F. F. Yao, "On the optimality of linear merge," SIAM Journal of Computing, vol. 9, pp. 85-90, 1980.
15. C. Christen, "Improving the bound on optimal merging," in Proceedings of the 19th IEEE Symposium on Foundation of Computer Science), 1978, pp. 259-266.
16. G. K. Manacher, "Significant improvements to the Hwang-Lin merging algorithm," Journal of ACM, vol. 26, pp. 434-440, 1979.
17. E. D. Demaine, A. López-Ortiz, and J. I. Munro, "Adaptive set intersections, unions and differences," in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2000, pp. 743-752.
18. J. Barbay and C. Kenyon, "Alternation and redundancy analysis of the intersection problem," ACM Transactions on Algorithms, vol. 4, no. 1, 2008.
19. S. Carlsson, C. Levcopoulos, and O. Petersson, "Sublinear merging and natural mergesort," in Proceedings of the Intl. Symposium on Algorithms, 1990, pp. 251-260.