By Topic

Zero-error instantaneous coding of correlated sources with length constraints is NP-complete

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

2 Author(s)
Yan, Y.-O. ; MathWorks Inc., Natick, MA, USA ; Berger, T.

It is well known that the Kraft inequality gives a necessary and sufficient condition on the codeword lengths of a zero-error instantaneous code for a single source. However, generalization for two correlated sources is nontrivial. We show that in the Slepian-Wolf configuration, even if one source is known at the decoder, designing a zero-error instantaneous code with given codeword lengths for the other source is NP-complete.

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 4 )