Question: [25] Prove that for each binary string x of length n there is a y equal to x except for one bit such that C(y|n)
[25] Prove that for each binary string x of length n there is a y equal to x except for one bit such that C(y|n) ≤ n − log n + O(1).
Comments. Hint: The set of binary strings of length n constituting a Hamming code has 2n/n elements and is computable. Source: personal communication, I. Csisz´ar, May 8, 1993.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
