We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A note on multiset decipherable codes

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
$31 $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)
Restivo, A. ; Dept. of Math. & Appl., Palermo Univ., Italy

In a recent paper A. Lempel (ibid., vol.IT-32, p.714-16, 1986) introduced the notion of a multiset decipherable (MSD) code to handle some special problems of information transmission. He showed that no MSD code contains a full prefix code as a proper subcode; he further conjectured that no MSD code contains a full uniquely decipherable code as a proper subcode and that every MSD code satisfies the Kraft inequality. A proof of the first conjecture and a disproof of the second are given

Published in:

Information Theory, IEEE Transactions on  (Volume:35 ,  Issue: 3 )