Two inequalities implied by unique decipherability
From MaRDI portal
Publication:5510064
DOI10.1109/TIT.1956.1056818zbMath0137.13503WikidataQ56504917 ScholiaQ56504917MaRDI QIDQ5510064
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
94A24: Coding theorems (Shannon theory)
Related Items
UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS, A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes, Two properties of prefix codes and uniquely decodable codes, A Kraft-McMillan inequality for free semigroups of upper-triangular matrices, New results on Nyldon words and Nyldon-like sets, Binary trees with choosable edge lengths, The asymptotic number of solutions of a diophantine equation from coding theory, A fast algorithm for the unique decipherability of multivalued encodings, On the ratio of prefix codes to all uniquely decodable codes with a given length distribution, Robust universal complete codes for transmission and compression, On the proportion of prefix codes in the set of three-element codes, A normalized value for information purchases, On the set of uniquely decodable codes with a given sequence of code word lengths, Inaccuracy and coding theory, A note on growing binary trees
