Two inequalities implied by unique decipherability

  title={Two inequalities implied by unique decipherability},
  author={Brockway McMillan},
  journal={IRE Trans. Inf. Theory},
  • B. McMillan
  • Published 1 December 1956
  • Mathematics
  • IRE Trans. Inf. Theory
Consider a list of b words, each word being a string of letters from a given fixed alphabet of a letters. If every string of words drawn from this list, when written out in letters without additional space marks to separate the words, is uniquely decipherable, then \begin{equation} a^{-l_1} + a^{-l_2} + \cdots + a^{-l_b} \leq 1, \qquad \qquad (1) \end{equation} where l_i, 1 \leq i \leq b , is the length of the i th word in the list. This result extends a remark of J. L. Doob, who derived the… 

Figures from this paper

On the 3/4-Conjecture for Fix-Free Codes -- A Survey

Since any code has Kraftsum smaller than or equal to one, this answers the question for the second implication of Kraft-McMillan's theorem.

Linear Time Recognition of Optimal L-Restricted Prefix Codes (Extended Abstract)

Given an alphabet Σ = {a1,...,an} and a corresponding list of weights [w1,...,wn], an optimal prefix code is a prefix code for Σ that minimizes the weighted length of a code string, defined to be

Note on unique decipherability

  • E. Jaynes
  • Computer Science
    IRE Trans. Inf. Theory
  • 1959
An alphabet of a letters is considered, used under the restrictions: 1) messages uniquely decipherable into words by use of one of the letters as a space mark, and 2) words limited to a maximum length of L letters, to find the attainable rate of information transmission under semi-optimal conditions.

Universal codes of the natural numbers

A natural partial order is defined on the set of codes, and it is proved that the existence of a scale of codes (a well-ordered set of code which contains a code better than any given code) is independent of ZFC.

Redundancy Estimates for Word-Based Encoding of Sequences Produced by a Bernoulli Source

Word-based codes can attain the same redundancy as block-codes while being much less complex, and uniform on the output codes is considered, the benefit of which is the lack of a running synchronization error.

Full decodable code-word sets

This paper considers further how the decodability condition imposes restrictions on a set of code words and shows that the sum of arbitrary probabilities associated with the words of a full set must be one.

Bounding the Inefficiency of Length-Restricted Prefix Codes

The results presented in this paper suggest that one can efficiently implement length restricted prefix codes, obtaining also very effective codes.

On the ratio of prefix codes to all uniquely decodable codes with a given length distribution

  • A. Woryna
  • Computer Science, Mathematics
    Discret. Appl. Math.
  • 2018

Constructing codes with ordered codeword lengths (Corresp.)

  • D. Voorhis
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1975
This correspondence describes an algorithm for calculating C_b in O((b-\log_2 N)N^2) steps.