Zhao, Qian and Effros, Michelle (2005) Uniquely decodable multiple access source codes. In: IEEE International Symposium on Information Theory (ISIT '04), Chicago, Illinois, 27 June-2 July 2004. IEEE , Los Alamitos, CA, p. 197. ISBN 0-7803-8280-3 http://resolver.caltech.edu/CaltechAUTHORS:ZHAisit04
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 251Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:ZHAisit04
Abstract
The Slepian-Wolf bound raises interest in lossless code design for multiple access networks. Previous work treats instantaneous codes. We generalize the Sardinas and Patterson test and bound the achievable rate region for uniquely decodable codes. The Kraft inequality is generalised to produce the necessary conditions on the codeword lengths for uniquely decodable-side information source code.
| Item Type: | Book Section |
|---|---|
| Additional Information: | © Copyright 2004 IEEE. Reprinted with permission. This material is based upon work supported by NSF Award No. CCR-0220039, the Caltech Lee Center for Advanced Networking, and the Howard Oringer Fellowship. |
| Subject Keywords: | Kraft inequality; Sardinas-Patterson test; Slepian-Wolf bound; lossless side information source code; uniquely decodable multiple access network; source coding theory; network information theory |
| Record Number: | CaltechAUTHORS:ZHAisit04 |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:ZHAisit04 |
| Alternative URL: | http://dx.doi.org/10.1109/ISIT.2004.1365234 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 4761 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 06 Sep 2006 |
| Last Modified: | 26 Dec 2012 09:01 |
Repository Staff Only: item control page
