Question:
(a) A statistical encoding algorithm is being considered for the transmission of a large number of long text files over a public network. Part of the file content is as follows:
Assumption : empty spaces are taken into consideration.
Using the Shannon - Fano algorithm compute the following:
i) the average number of bits per codeword
ii) the entropy of the source
iii) the minimum number of bits required assuming fixed-length codeword
iv) the compression ratio based on this algorithm if we assume an ASCII of 8 bits representation
Support your answers with a Shannon tree and show necessary calculations for each part of the question.
(b) How do you compare the Shannon Fano with the Lempel Ziv Welsh (LZW) Algorithm?