New converses in the theory of identification via channels
IEEE Transactions on Information Theory
Optimistic Shannon coding theorems for arbitrary single-user systems
IEEE Transactions on Information Theory
The source-channel separation theorem revisited
IEEE Transactions on Information Theory
Generalized cutoff rates and Renyi's information measures
IEEE Transactions on Information Theory
Optimal design of sequential real-time communication systems
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
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ényi's divergence of order 0. The bounds are also studied in the limit of large blocklengths. In particular, they combine to give a general capacity formula which is equivalent to the one derived by Verdú and Han.