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

Lesson 2

Nikolai Chukhin · Alexander S. Kulikov

Problem. Mark the uniquely decodable codes over \(\Sigma = \{ a, b, c, d \}\):

1 point

  1. \(\phi(a) = 00\), \(\phi(b) = 01\), \(\phi(c) = 10\), \(\phi(d) = 11\)

  2. \(\phi(a) = 0\), \(\phi(b) = 110\), \(\phi(c) = 10\), \(\phi(d) = 111\)

  3. \(\phi(a) = 1\), \(\phi(b) = 110\), \(\phi(c) = 10\), \(\phi(d) = 111\)