TOPICS
Search

Shannon's Noiseless Coding Theorem



Explore with Wolfram|Alpha

References

Let S be an information source with entropy H(S). ThenH(S)<=m(S),where m(S) is the minimum average code-word length among all uniquely decipherable coding schemes for SReferencesCasti, J. L. "The Shannon Coding Theorem." Ch. 1 in Five More Golden Rules: Knots, Codes, Chaos, and Other Great Theories of 20th-Century Mathematics. New York: Wiley, pp. 207-254, 2000.