A beta-beta achievability bound with applications

A beta-beta achievability bound with applications

A channel coding achievability bound expressed in terms of the ratio between two Neyman-Pearson β functions is proposed. This bound is the dual of a converse bound established earlier by Polyanskiy and Verdú (2014). The new bound turns out to simplify considerably the analysis in situations where t...

Full description

Bibliographic Details
Main Authors: Yang, Wei, Durisi, Giuseppe, Poor, H. Vincent, Collins, Austin Daniel, Polyanskiy, Yury
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2018
Online Access:http://hdl.handle.net/1721.1/113659
https://orcid.org/0000-0002-4962-0935
https://orcid.org/0000-0002-2109-0979

Internet

http://hdl.handle.net/1721.1/113659
https://orcid.org/0000-0002-4962-0935
https://orcid.org/0000-0002-2109-0979

Similar Items