Coding theorem and strong converse for quantum channels

In this correspondence, we present a new proof of Horevo's coding theorem f or transmitting classical information through quantum channels, and its str ong converse. The technique is largely inspired by Wolfowitz's combinatoria l approach using types of sequences. As a byproduct of our approach which i s independent of previous ones, both in the coding theorem and the converse , we can give a new proof of Holevo's information bound.