@inproceedings{286f2f4f4fe142fbb707892df4b42aad,
title = "Arimoto channel coding converse and R{\'e}nyi divergence",
abstract = "Arimoto [1] proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memoryless channel. In this paper we present a simple derivation of the Arimoto converse based on the data-processing inequality for R{\'e}nyi divergence. The method has two benefits. First, it generalizes to codes with feedback and gives the simplest proof of the strong converse for the DMC with feedback. Second, it demonstrates that the sphere-packing bound is strictly tighter than Arimoto converse for all channels, blocklengths and rates, since in fact we derive the latter from the former. Finally, we prove similar results for other (non-R{\'e}nyi) divergence measures.",
keywords = "Feedback, Information measures, R{\'e}nyi divergence, Shannon theory, Strong converse",
author = "Yury Polyanskiy and Sergio Verd{\'u}",
year = "2010",
doi = "10.1109/ALLERTON.2010.5707067",
language = "English (US)",
isbn = "9781424482146",
series = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",
pages = "1327--1333",
booktitle = "2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010",
note = "48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 ; Conference date: 29-09-2010 Through 01-10-2010",
}