Jump to content

Shannon–Fano–Elias coding

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dicklyon (talk | contribs) at 00:21, 4 June 2011 (ref). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In information theory, Shannon–Fano–Elias coding is a precursor to arithmetic coding, in which probabilities are used to determine codewords.[1]

References

  1. ^ T. M. Cover and Joy A. Thomas (2006). Elements of information theory (2nd ed.). John Wiley and Sons. pp. 127–128. ISBN 9780471241959.
Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Shannon–Fano–Elias_coding&oldid=432442901"