Finite-blocklength bounds for wiretap channels

descriptionPublicationkeyboard_double_arrow_right Article , Preprint , Conference object 01 Jul 2016Embargo end date: 01 Jan 2016Publisher:IEEEJournal:2016 IEEE International Symposium on Information Theory (ISIT)Funded by:NSF | CIF: Small: Collaborative..., NSF | Collaborative Research: E...

Authors: Wei Yang 0001; Rafael F. Schaefer; H. Vincent Poor;

doi: 10.1109/isit.2016.7541867 , 10.48550/arxiv.1601.06055

arXiv: 1601.06055

Finite-blocklength bounds for wiretap channels

- Summary
- Subjects
- Metrics

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.

extended version of a paper submitted to ISIT 2016

Related Organizations

View all View all

Keywords

FOS: Computer and information sciences, Computer Science - Information Theory, Information Theory (cs.IT)

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	41
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%