DocumentCode :
2022389
Title :
Kraft Inequality and Zero-Error Source Coding with Decoder Side Information
Author :
Tuncel, E.
Author_Institution :
Univ. of California, Riverside
fYear :
2007
fDate :
24-29 June 2007
Firstpage :
446
Lastpage :
450
Abstract :
This paper tackles the problem of zero-error instantaneous coding with decoder side information in light of the Kraft inequality. Specifically, a bounded Kraft sum over all cliques in the characteristic graph of the source/side-information pair is envisioned to be a sufficient condition for the existence of a valid code with given codeword lengths. It is shown that (i) if such a sufficient condition exists for a class of graphs, it is possible to universally bound the rate redundancy in the class, (ii) there exist graph classes of interest for which such sufficient conditions can indeed be found, and finally (iii) no such condition can be found for the class of all graphs.
Keywords :
decoding; graph theory; source coding; Kraft inequality; bounded Kraft sum; characteristic graph; codeword length; decoder side information; rate redundancy; zero-error instantaneous coding; zero-error source coding; Binary codes; Decoding; Graph theory; Probability distribution; Random variables; Source coding; Sufficient conditions; Testing; Yttrium;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2007. ISIT 2007. IEEE International Symposium on
Conference_Location :
Nice
Print_ISBN :
978-1-4244-1397-3
Type :
conf
DOI :
10.1109/ISIT.2007.4557266
Filename :
4557266
Link To Document :
بازگشت