Toward a source coding theory for sets

Lav R. Varshney; Vivek K. Goyal

doi:10.1109/DCC.2006.78

Toward a source coding theory for sets

Lav R. Varshney
, Vivek K. Goyal

Office of the Provost

Massachusetts Institute of Technology

Research output: Contribution to journal › Conference article › peer-review

29 Scopus citations

Abstract

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.

Original language	English
Article number	1607236
Pages (from-to)	13-22
Number of pages	10
Journal	Data Compression Conference Proceedings
DOIs	https://doi.org/10.1109/DCC.2006.78
State	Published - 2006
Event	Data Compression Conference, DCC 2006 - Snowbird, UT, United States Duration: Mar 28 2006 → Mar 30 2006

Access to Document

10.1109/DCC.2006.78

Cite this

@article{b841d481f5d442ac8f383fb4018f0f2e,

title = "Toward a source coding theory for sets",

abstract = "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.",

author = "Varshney, \{Lav R.\} and Goyal, \{Vivek K.\}",

year = "2006",

doi = "10.1109/DCC.2006.78",

language = "English",

pages = "13--22",

journal = "Data Compression Conference Proceedings",

issn = "1068-0314",

note = "Data Compression Conference, DCC 2006 ; Conference date: 28-03-2006 Through 30-03-2006",

}

TY - JOUR

T1 - Toward a source coding theory for sets

AU - Varshney, Lav R.

AU - Goyal, Vivek K.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/65749113844

U2 - 10.1109/DCC.2006.78

DO - 10.1109/DCC.2006.78

M3 - Conference article

AN - SCOPUS:65749113844

SN - 1068-0314

SP - 13

EP - 22

JO - Data Compression Conference Proceedings

JF - Data Compression Conference Proceedings

M1 - 1607236

T2 - Data Compression Conference, DCC 2006

Y2 - 28 March 2006 through 30 March 2006

ER -

Toward a source coding theory for sets

Abstract

Access to Document

Other files and links

Fingerprint

Cite this