Finite-blocklength bounds for wiretap channels

Wei Yang; Rafael F. Schaefer; H. Vincent Poor

doi:10.1109/ISIT.2016.7541867

Finite-blocklength bounds for wiretap channels

Wei Yang, Rafael F. Schaefer, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

56 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	3087-3091
Number of pages	5
ISBN (Electronic)	9781509018062
DOIs	https://doi.org/10.1109/ISIT.2016.7541867
State	Published - 10 Aug 2016
Externally published	Yes
Event	2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain Duration: 10 Jul 2016 → 15 Jul 2016

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2016-August
ISSN (Print)	2157-8095

Conference

Conference	2016 IEEE International Symposium on Information Theory, ISIT 2016
Country/Territory	Spain
City	Barcelona
Period	10/07/16 → 15/07/16

Access to Document

10.1109/ISIT.2016.7541867

Cite this

Yang, W., Schaefer, R. F., & Poor, H. V. (2016). Finite-blocklength bounds for wiretap channels. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 3087-3091). Article 7541867 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541867

@inproceedings{c18357dfa1674e47bea797c3d115dd86,

title = "Finite-blocklength bounds for wiretap channels",

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.",

author = "Wei Yang and Schaefer, \{Rafael F.\} and Poor, \{H. Vincent\}",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",

year = "2016",

month = aug,

day = "10",

doi = "10.1109/ISIT.2016.7541867",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "3087--3091",

booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",

}

Yang, W, Schaefer, RF & Poor, HV 2016, Finite-blocklength bounds for wiretap channels. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541867, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 3087-3091, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 10/07/16. https://doi.org/10.1109/ISIT.2016.7541867

Finite-blocklength bounds for wiretap channels. / Yang, Wei; Schaefer, Rafael F.; Poor, H. Vincent.
Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 3087-3091 7541867 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Finite-blocklength bounds for wiretap channels

AU - Yang, Wei

AU - Schaefer, Rafael F.

AU - Poor, H. Vincent

PY - 2016/8/10

Y1 - 2016/8/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84985993674&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541867

DO - 10.1109/ISIT.2016.7541867

M3 - Conference contribution

AN - SCOPUS:84985993674

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 3087

EP - 3091

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016

Y2 - 10 July 2016 through 15 July 2016

ER -

Finite-blocklength bounds for wiretap channels

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this