1.1. Assume you have a source alphabet that includes the 5 symbols {a, b, c, d, (eof)}, and that your table is initialized with these symbols. Encode the following sequence using the LZW algorithm: abbadabbadabbadabbadabbacadabbacadabba(eof)

1.2.Assuming the same 5-symbol alphabet, use a decimal arithmetic code to encode the same message. You may want to write a short computer program to do this, rather than doing it by hand. Initially assume that all symbols have equal probability.

1.3. Repeat question 1.2, using the actual letter frequencies to determine the probability model. View comments (1)