Two inequalities implied by unique decipherability

DOI10.1109/TIT.1956.1056818zbMath0137.13503OpenAlexW2169476932WikidataQ56504917 ScholiaQ56504917MaRDI QIDQ5510064

B. McMillan

Publication date: 1965

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1956.1056818

zbMATH Keywords

inequalities implied by unique decipherability

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Related Items (15)

A normalized value for information purchases ⋮ New results on Nyldon words and Nyldon-like sets ⋮ UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ A fast algorithm for the unique decipherability of multivalued encodings ⋮ On the set of uniquely decodable codes with a given sequence of code word lengths ⋮ Robust universal complete codes for transmission and compression ⋮ On the proportion of prefix codes in the set of three-element codes ⋮ Two properties of prefix codes and uniquely decodable codes ⋮ A Kraft-McMillan inequality for free semigroups of upper-triangular matrices ⋮ On the ratio of prefix codes to all uniquely decodable codes with a given length distribution ⋮ The asymptotic number of solutions of a diophantine equation from coding theory ⋮ Binary trees with choosable edge lengths ⋮ Inaccuracy and coding theory ⋮ A note on growing binary trees ⋮ A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes

This page was built for publication: Two inequalities implied by unique decipherability