This talk is based on "Simple channel coding bounds" by Wang et al, ISIT, 2009. New channel coding converse and achievability bounds are derived for a single use of an arbitrary channel. Both bounds are expressed using a quantity called the “smooth 0-divergence”, which is a generalization of R´enyi’s divergence of order 0.
