Data Compression Conference (DCC'06) Toward a Source Coding Theory for Sets Snowbird, Utah March 28-March 30 ISBN: 0-7695-2545-8
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.78
The problem of communicating (unordered) sets, rather than (ordered) sequences is formulated. Elementary results in all major branches of source coding theory, including lossless coding, high-rate and low-rate quantization, and rate distortion theory are presented. In certain scenarios, rate savings of log n! bits for sets of size n are obtained. Asymptotically in the set size, the entropy rate is zero and for sources with an ordered parent alphabet, the (0, 0) point is the rate distortion function.
Citation:
Lav R. Varshney, Vivek K Goyal, "Toward a Source Coding Theory for Sets," dcc, pp.13-22, Data Compression Conference (DCC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||