Access the full text.
Sign up today, get DeepDyve free for 14 days.
H. Witsenhausen (1976)
The zero-error side information problem and chromatic numbers (Corresp.)IEEE Trans. Inf. Theory, 22
B. McMillan (1956)
Two Inequalities by Unique DecipherabilityIRE Trans., IT-2
B. McMillan (1956)
Two inequalities implied by unique decipherabilityIRE Trans. Inf. Theory, 2
C. E. Shannon (1956)
The Zero Capacity of a Noisy ChannelIRE Trans., IT-2
L. Lovász (1979)
On the Shannon capacity of a graphIEEE Trans. Inf. Theory, 25
R. Gallager (1968)
Information Theory and Reliable Communication
C. Shannon (1956)
The zero error capacity of a noisy channelIRE Trans. Inf. Theory, 2
H. S. Witsenhausen (1976)
The Zero-Error Side Information Problem and Chromatic NumbersIEEE Trans., IT-22
In this paper we consider the zero error variable length coding problem for discrete memoryless sources with side information at the decoder only. Using concepts of graph theory, we obtain a characterization of the minimum achievable rater for this coding problem. Furthermore, computable upper and lower bounds for the minimum achievable rater is given and a condition under which the upper and lower bounds are equal is found. Finally, this result is applied to some examples in which the minimum achievable rater can be evaluated.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 13, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.