Universal linked multiple access source codes
- Creators
- Jaggi, Sidharth
- Effros, Michelle
Abstract
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.
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.Files
Name | Size | Download all |
---|---|---|
md5:fb9613d25d9d74c4fa69f9b7257f808d
|
127.5 kB | Preview Download |
Additional details
- Eprint ID
- 7436
- Resolver ID
- CaltechAUTHORS:JAGisit02
- Created
-
2007-02-13Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field