Coleman, Todd P. and Effros, Michelle and Martinian, Emin and Médard, Muriel (2005) Rate-splitting for the deterministic broadcast channel. In: International Symposium on Information Theory (ISIT 2005), Adelaide, South Australia, Australia, 4-9 September 2005. IEEE , pp. 2189-2192. ISBN 0-7803-9151-9. https://resolver.caltech.edu/CaltechAUTHORS:COLisit05
![]()
|
PDF
See Usage Policy. 195kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:COLisit05
Abstract
We show that the deterministic broadcast channel, where a single source transmits to M receivers across a deterministic mechanism, may be reduced, via a rate-splitting transformation, to another (2M−1)-receiver deterministic broadcast channel problem where a successive encoding approach suffices. Analogous to rate-splitting for the multiple access channel and source-splitting for the Slepian-Wolf problem, all achievable rates (including non-vertices) apply. This amounts to significant complexity reduction at the encoder.
Item Type: | Book Section | ||||||
---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||
Additional Information: | © Copyright 2005 IEEE. Reprinted with permission. | ||||||
DOI: | 10.1109/ISIT.2005.1523735 | ||||||
Record Number: | CaltechAUTHORS:COLisit05 | ||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:COLisit05 | ||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
ID Code: | 7298 | ||||||
Collection: | CaltechAUTHORS | ||||||
Deposited By: | Archive Administrator | ||||||
Deposited On: | 26 Jan 2007 | ||||||
Last Modified: | 08 Nov 2021 20:41 |
Repository Staff Only: item control page