Construct · 1 fields · 1 citations

Kraft-McMillan inequality: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Information theory

condition on codeword lengths that every uniquely decodable code must meet and that suffices for a prefix code with those lengths to exist.

In information theory, Kraft-McMillan inequality refers to condition on codeword lengths that every uniquely decodable code must meet and that suffices for a prefix code with those lengths to exist. This meaning comes from McMillan (1956) in IEEE Transactions on Information Theory.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Kraft-McMillan inequality sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

code3 fields · 6 citationsjingle · one word, three constructs condition2 fields · 2 citationsjingle · one word, two constructs information4 fields · 5 citationsjingle · one word, four constructs

References

McMillan, B. (1956). Two inequalities implied by unique decipherability. IEEE Transactions on Information Theory, 2(4), 115-116. https://doi.org/10.1109/tit.1956.1056818

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct