Merge source coding

Authors:
Bruno T. Ávila;Eduardo S. Laber
Affiliations:
Computer Science Department, PUC-Rio, Rio de Janeiro, Brazil;Computer Science Department, PUC-Rio, Rio de Janeiro, Brazil
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 7
Cited 1

Two probabilistic results on merging

SIAM Journal on Computing
Significant Improvements to the Hwang-Lin Merging Algorithm

Journal of the ACM (JACM)
Adaptive set intersections, unions, and differences

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Binary Interpolative Coding for Effective Index Compression

Information Retrieval
Sublinear Merging and Natural Merge Sort

SIGAL '90 Proceedings of the International Symposium on Algorithms
Alternation and redundancy analysis of the intersection problem

ACM Transactions on Algorithms (TALG)
Improving the bounds on optimal merging

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

On compressing permutations and adaptive sorting

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that any comparison-based merging algorithm can be naturally mapped into a source coder via a conversion function introduced here. By applying this function over some well known merging algorithms, namely Binary Merging and Recursive Merging, we show that they are closely related to a runlength-based coder with Rice coding and to the Binary Interpolative Coder, respectively. Furthermore, by applying the conversion function over the Probabilistic Merging algorithm we obtain a runlength-based coder that uses a new variant of the Rice code, namely Randomized Rice Code. This new code uses a random source of bits with the aim of reducing its average redundancy.