1. What are the contributions in this paper?
In this paper, the Slepian-Wolf bound on the achievable rate region for uniquely decodable codes was introduced.
read more
Uniquely decodable multiple access source codes
Qian Zhao,Michelle Effros +1 more
- 27 Jun 2004
- pp 195
TL;DR: The Sardinas and Patterson test is generalized and the Kraft inequality is generalised to produce the necessary conditions on the codeword lengths for uniquely decodable-side information source code.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Most frequently asked questions
Citations
References
Related Papers (5)
Kengo Hashimoto,Ken-ichi Iwata +1 more
- 12 Jul 2021
Sergey Yekhanin
- 30 May 2011
Wojciech Szpankowski
- 31 Oct 2005