Key points are not available for this paper at this time.
A new lower bound on the probability of decoding error for the case of rates above capacity is presented. It forms a natural companion to Gallager's random coding bound for rates below capacity. The strong converse to the coding theorem follows immediately from the proposed lower bound.
S. Arimoto (Tue,) studied this question.