By Topic

Conjectures on uniquely decipherable codes (Corresp.)

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

2 Author(s)

A conjecture concerning the codeword compositions of uniquely decipherable codes is proposed. This conjecture is shown to be equivalent to a related conjecture of Karp about the codeword costs of uniquely decipherable codes. A set of inequalities satisfied by ali prefix-condition codes is exhibited, and it is conjectured that these inequalities are valid for all uniquely decipherable codes.

Published in:

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