| dc.contributor.author | Polyanskiy, Yury | |
| dc.contributor.author | Verdu, Sergio | |
| dc.date.accessioned | 2013-07-23T13:32:11Z | |
| dc.date.available | 2013-07-23T13:32:11Z | |
| dc.date.issued | 2011-09 | |
| dc.identifier.isbn | 978-1-4577-1818-2 | |
| dc.identifier.isbn | 978-1-4577-1817-5 | |
| dc.identifier.isbn | 978-1-4577-1816-8 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/79672 | |
| dc.description.abstract | 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). | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-06-35154) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant CCF-07-28445) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1109/Allerton.2011.6120149 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike 3.0 | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/ | en_US |
| dc.source | Polyanskiy via Amy Stout | en_US |
| dc.title | Relative entropy at the channel output of a capacity-achieving code | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | 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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems | en_US |
| dc.contributor.mitauthor | Polyanskiy, Yury | en_US |
| dc.contributor.mitauthor | Verdu, Sergio | en_US |
| dc.relation.journal | Proceedings of the 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton) | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dspace.orderedauthors | Polyanskiy, Yury; Verdu, Sergio | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-2109-0979 | |
| mit.license | OPEN_ACCESS_POLICY | en_US |
| mit.metadata.status | Complete | |
