loading...
Toward a Source Coding Theory for Sets
Snowbird, Utah March 28-March 30
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DCC.2006.78Data Compression Conference (DCC'06)
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Lav R. Varshney, Vivek K Goyal, "Toward a Source Coding Theory for Sets," Data Compression Conference, pp. 13-22, Data Compression Conference (DCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DCC.2006.78,
author = {Lav R. Varshney and Vivek K Goyal},
title = {Toward a Source Coding Theory for Sets},
journal ={Data Compression Conference},
volume = {0},
year = {2006},
issn = {1068-0314},
pages = {13-22},
doi = {http://doi.ieeecomputersociety.org/10.1109/DCC.2006.78},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Data Compression Conference
TI - Toward a Source Coding Theory for Sets
SN - 1068-0314
SP13
EP22
A1 - Lav R. Varshney,
A1 - Vivek K Goyal,
PY - 2006
KW - null
VL - 0
JA - Data Compression Conference
ER -
 
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.