1 / 11
By the no-free-lunch theorem, the fraction of n-bit files a lossless code can shorten by at least k bits is less than 2^(-k+1). For k = 10, give this bound as a power of 2, i.e. give the exponent m in 2^(-m).
Review the explanation for this topic →Your answer