By Topic

Universal linked multiple access source codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jaggi, S. ; Dept. of Electr. Eng., California Inst. of Technol., Pasadena, CA, USA ; Effros, M.

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.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: