Two inequalities implied by unique decipherability

DOI10.1109/TIT.1956.1056818MaRDI QIDQ5510064zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1247872
• On multiset decipherable codes (Corresp.)
• scientific article; zbMATH DE number 1260845
• On Unique Decodability
• Channels which transmit letters of unequal duration

Cited in

(15)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5510064)