pith. sign in

arxiv: 0901.0834 · v3 · submitted 2009-01-07 · 💻 cs.IT · math.IT

Simple Channel Coding Bounds

classification 💻 cs.IT math.IT
keywords boundschannelcodingderiveddivergenceachievabilityarbitraryblock-lengths
0
0 comments X
read the original abstract

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 Renyi's divergence of order 0. The bounds are also studied in the limit of large block-lengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdu and Han.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.