Proofs of Algorithm Correctness and Runtime Estimates · Application: Data Compression (Optional)

Lesson 5

Nikolai Chukhin · Alexander S. Kulikov

Problem. For which set of codeword lengths \(l_{1}, …, l_{n}\) is it impossible to construct a uniquely decodable code?

1 point

  1. \(\{2, 3, 4, 4\}\)

  2. \(\{1, 2, 3, 3\}\)

  3. \(\{2, 2, 2, 3, 3\}\)

  4. \(\{2, 2, 2, 2, 2\}\)