Decode the string 01100111111111100011, which has been made with the code in Example 6.1.
Example 6.1
Let and (this is the code of Example 5.1 in reversed order). This code C is U.D., as we shall now demonstrate. Consider a concatenation of code words. If the left most bit is a 1, the left most codeword is 111. If on the other hand the left most bit is a 0, the concatenation either looks like for some or it starts with the subsequence for some positive integer k. Depending on whether or the left most codeword is 0, 01 resp. 011. One can now remove this codeword and apply the same decoding rule to the remaining, shorter concatenation of code words.