Published January 10, 2005
| public
Book Section - Chapter
Open
Uniquely decodable multiple access source codes
- Creators
- Zhao, Qian
- Effros, Michelle
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.
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.Files
ZHAisit04.pdf
Files
(257.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:90f9aa45a96bf74a754f2ad06ef241e2
|
257.3 kB | Preview Download |
Additional details
- Eprint ID
- 4761
- Resolver ID
- CaltechAUTHORS:ZHAisit04
- Created
-
2006-09-06Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field