Prefix code: Difference between revisions

Revision as of 14:01, 14 May 2006

Revision as of 14:04, 14 May 2006

Line 88:

If we have a fixed number of symbols <math>|X|</math>(the alphabet size), then for any given list of codeword lengths <math>(l_i)_{i=1...n}</math> a prefix code exists if and only if <math>\sum_{i=1}^{n}|X|^{-l_i}\le 1</math>. This is known as [[Kraft's inequality|''Kraft's inequality'']].

== errorUses in Error handling ==

Many communication systems are not completely error-free.