DocumentCode
1140053
Title
A note on multiset decipherable codes
Author
Restivo, Antonio
Author_Institution
Dept. of Math. & Appl., Palermo Univ., Italy
Volume
35
Issue
3
fYear
1989
fDate
5/1/1989 12:00:00 AM
Firstpage
662
Lastpage
663
Abstract
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
Keywords
codes; Kraft inequality; full prefix code; information transmission; multiset decipherable codes; proper subcode; Hypercubes; Modulation coding; Notice of Violation; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.30991
Filename
30991
Link To Document