Relative entropy at the channel output of a capacity-achieving code
Author(s)Polyanskiy, Yury; Verdu, Sergio
MetadataShow full item record
In this paper we establish a new inequality tying together the coding rate, the probability of error and the relative entropy between the channel and the auxiliary output distribution. This inequality is then used to show the strong converse, and to prove that the output distribution of a code must be close, in relative entropy, to the capacity achieving output distribution (for DMC and AWGN). One of the key tools in our analysis is the concentration of measure (isoperimetry).
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Proceedings of the 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Institute of Electrical and Electronics Engineers (IEEE)
Polyanskiy, Yury, and Sergio Verdu. Relative Entropy at the Channel Output of a Capacity-achieving Code. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 52-59. Institute of Electrical and Electronics Engineers, 2011.
Author's final manuscript