Find the shortest encoded bit string of the following source sequence: Source sequence: ABCCDEAFABCBEDFABCBBAEFFEBCEFF
(a) using extended Huffman coding to encode the string where k=2
(b) using arithmetic coding.
For this case, you can ignore the termination issue ina a decoder, and output the shortestbit string of the first 5 symbols only, while the probability distribution is based on the whole sequence.
Save your time - order a paper!
Get your paper written from scratch within the tight deadline. Our service is a reliable solution to all your troubles. Place an order on any task and we will take care of it. You won’t have to worry about the quality and deadlinesOrder Paper Now
(c) Using adaptive Huffman coding to encode the first 10 symbols of the string. The initial code assignment is given below
- New : 0
- A : 00001
- B : 00010
- C : 00011
- D : 00100
- E : 00101
- F : 00110