True or False

1. In Huffman coding, the tag corresponds to a binary fraction, which becomes the binary code for the
sequence.
2. The Arithmetic coding approach is working by conceptually divide the approach into Tag Generation
Phase and Providing a unique binary code for Tag.
3. Arithmetic coding is especially useful when dealing with sources with small alphabets,
such as binary sources, and alphabets with highly skewed probabilities.
4. In Arithmetic coding a unique identifier or tag is generated for the sequence to be encoded.
5. In Arithmetic coding, tag corresponds to a binary fraction, which becomes the binary code
for the sequence.
6. To generate a Huffman code for a sequence of length m, where the code is not a concatenation
7. of the codewords for the individual symbols, we have to obtain the Huffman codes for all
8. sequences of length m.
9. Choosing a static dictionary technique is most appropriate when considerable prior knowledge about
the source is available.
10. In many applications, the output of the source consists of non- recurring patterns.
11. An example of adaptive dictionary techniques is digram coding.
12. In Digram Coding, , the dictionary consists of all letters of the source alphabet followed by as many
pairs of letters, called digrams, as can be accommodated by the dictionary.
13. In LZ78, The encoder examines the input sequence through a sliding window.
14. In LZ77, To encode the sequence in the look-ahead buffer, the encoder moves a search pointer back
through the search buffer until it encounters a match to the first symbol in the look-ahead buffer.
15. In LZ77, Use of a triple is highly inefficient, especially if a large number of characters occur
infrequently.
16. Data compressed using lossy techniques generally cannot be recovered or reconstructed exactly.
17. One way of reporting compression performance is to provide the average number of bits required to
represent a single sample. This is generally referred to as the rate.
18. Text compression is an important area for lossless compression.
19. The development of data compression algorithms for a variety of data can be divided into three
phases.
20. The difference between the original and the reconstruction is often called the distortion.
21. In Modeling phase, we try to extract information about any redundancy that exists in the data
and describe the redundancy in the form of a model.
22. In Coding Phase, A description of the model and a “description” of how the data differ from the
model are encrypted, generally using a binary alphabet.
23. In Markov Model, assume that each letter that is generated by the source is independent of
every other letter, and each occurs with the same probability. f
24. {0, 01, 10} are unique decodable code.