A Caltech Library Service

Universal linked multiple access source codes

Jaggi, Sidharth and Effros, Michelle (2002) Universal linked multiple access source codes. In: IEEE International Symposium on Information Theory (ISIT '02), Lausanne, Switzerland, 30 June-5 July 2002. IEEE , Piscataway, NJ, p. 95. ISBN 0-7803-7501-7.

See Usage Policy.


Use this Persistent URL to link to this item:


We consider the multiple access source coding (MASC) problem (also known as the Slepian-Wolf problem) for situations where the joint source statistics are unknown a priori. Since neither encoder receives information about the joint source statistics, we allow an asymptotically negligible amount of communication between the encoders. We prove the existence of universal 2-encoder linked MASCs (LMASCs) with rates approaching the Slepian-Wolf bound, demonstrate the tightness of this bound, and calculate the rate of convergence of the proposed universal LMASC. The result generalizes to M>2 encoders. We also consider scenarios where the number of bits passed between the system encoders is allowed to grow linearly in the code dimension; in these scenarios one encoder can act as a conduit for the flow of another encoder's information.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© Copyright 2002 IEEE. Reprinted with permission. This material is based upon work partially supported by a Caltech E&AS Division Fellowship, the NSF under Award No. CCR-9909026 and by the Caltech Lee Center for Advanced Networking.
Subject Keywords:multi-access systems, source coding, source code design, source coding theory, network information theory
Record Number:CaltechAUTHORS:JAGisit02
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:7436
Deposited By: Archive Administrator
Deposited On:13 Feb 2007
Last Modified:08 Nov 2021 20:42

Repository Staff Only: item control page