5 problems
Let be a prefix-free binary block set, with block lengths , and suppose that . Two-block depth law. If…
For each integer , define binary blocks … with lengths and , and let . The quantity denotes the relevan…
Let be the alphabet size and let be an arbitrary fixed number of transpositions. Consider codes of block length correcting transpositions, and let the optimal code…
Let be an erasure probability, and let denote the binary erasure channel with erasure probability . Let denote noisy p…
Let be a strictly positive discrete memoryless channel (DMC), let and denote the empirical distributions of the input and output seque…