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 20:03, 15 May 2011 (new stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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