DocumentCode
2054504
Title
Uniquely decodable multiple access source codes
Author
Zhao, Qian ; Effros, Michelle
Author_Institution
Oracle Corp., Redwood Shores, CA, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
195
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.
Keywords
multi-access systems; probability; source coding; subscriber loops; Kraft inequality; Sardinas-Patterson test; Slepian-Wolf bound; achievable rate region; codeword length; lossless side information source code; uniquely decodable multiple access network; Building materials; Decoding; Sufficient conditions; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365234
Filename
1365234
Link To Document