Finite-blocklength bounds for wiretap channels
Author(s): Yang, Wei; Schaefer, Rafael F; Poor, H Vincent
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr19k45s8d| Abstract: | This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing bounds. The bounds also lead to the tightest second-order coding rate for discrete memoryless and Gaussian wiretap channels. |
| Publication Date: | Jul-2016 |
| Citation: | Yang, Wei, Schaefer, Rafael F, Poor, H Vincent. (2016). Finite-blocklength bounds for wiretap channels. 2016 IEEE International Symposium on Information Theory (ISIT), 10.1109/isit.2016.7541867 |
| DOI: | doi:10.1109/isit.2016.7541867 |
| Type of Material: | Journal Article |
| Journal/Proceeding Title: | 2016 IEEE International Symposium on Information Theory (ISIT) |
| Version: | Author's manuscript |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.