Finite-blocklength bounds for wiretap channels

Author(s): Yang, Wei; Schaefer, Rafael F; Poor, H Vincent

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr19k45s8d

Full metadata record

DC Field	Value	Language
dc.contributor.author	Yang, Wei	-
dc.contributor.author	Schaefer, Rafael F	-
dc.contributor.author	Poor, H Vincent	-
dc.date.accessioned	2024-01-11T20:54:32Z	-
dc.date.available	2024-01-11T20:54:32Z	-
dc.date.issued	2016-07	en_US
dc.identifier.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	en_US
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr19k45s8d	-
dc.description.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.	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	2016 IEEE International Symposium on Information Theory (ISIT)	en_US
dc.rights	Author's manuscript	en_US
dc.title	Finite-blocklength bounds for wiretap channels	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1109/isit.2016.7541867	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1601.06055.pdf		567.25 kB	Adobe PDF	View/Download