Uniquely Decodable Codes in data compression
The average length of the code is not the only important point in designing a “good” code. Consider the following example adapted from [10]. Suppose our source alphabet consists of four letters a1, a2, a3, and a4, with probabilities P(a1)= 1/ 2 , P(a2) = 1 /4 , and P(a3) = P(a4) = 1 /8 … Read more