Shannon's source coding theorem in both directions, and Kraft's inequality — why entropy is the floor no lossless code can beat.0/11 mastered
1 / 11
A claimed lossless compressor maps every 1000-bit fair-coin file to at most 900 bits. At most 2^k distinct outputs of length at most 900 exist (ignoring the -1). Give k.