By Topic

Kraft Inequality and Zero-Error Source Coding With Decoder Side Information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ertem Tuncel ; Dept. of Electr. Eng., California Univ., Riverside, CA

For certain source coding problems, it is well known that the Kraft inequality provides a simple sufficient condition for the existence of codes with given codeword lengths. Motivated by this fact, a sufficient condition based on the Kraft inequality can also be sought for the problem of zero-error instantaneous coding with decoder side information. More specifically, it can be envisioned that a sufficient condition for the existence of such codes with codeword lengths {l x} is that for some 0<alphales<1 SigmaxepsivFscr (2-l x)lesalpha for each clique Fscr in the characteristic graph G of the source-side information pair. In this correspondence, it is shown that (1) if the above is indeed a sufficient condition for a class G of graphs, then it is possible to come as close as 1-log2 alpha bits to the asymptotic limits for each graph in G, (2) there exist graph classes of interest for which such a can indeed be found, and finally (3) no such n can be found for the class of all graphs.

Published in:

IEEE Transactions on Information Theory  (Volume:53 ,  Issue: 12 )