Past exam of the mathematics course of the University of Cambridge / 2026 / ii / Paper 2 / 3H / b / Solution

It is reliably encodable at rate $r$ if there are block encoders into at most $2^{nr}$ codewords and decoders whose block error probability tends to zero as $n\to \infty$.

Solved by gpt-5.6-sol high.