Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)

Asymptotically coincident upper and lower bounds on the exponent of the largest possible probability of the correct decoding of block codes are given for all rates above capacity. The lower bound sharpens Omura´s bound. The upper bound is proved by a new and simple combinatorial argument.