 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$.