Conjectures on uniquely decipherable codes (Corresp.)
暂无分享，去创建一个
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.
[1] Ben Varn,et al. Optimal Variable Length Codes (Arbitrary Symbol Cost and Equal Code Word Probability) , 1971, Inf. Control..
[2] Brockway McMillan,et al. Two inequalities implied by unique decipherability , 1956, IRE Trans. Inf. Theory.
[3] Richard M. Karp,et al. Minimum-redundancy coding for the discrete noiseless channel , 1961, IRE Trans. Inf. Theory.
[4] Shimon Even,et al. Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters , 1975, JACM.