Journal ArticleDOI
Channel Coding Rate in the Finite Blocklength Regime
Reads0
Chats0
TLDR
It is shown analytically that the maximal rate achievable with error probability ¿ isclosely approximated by C - ¿(V/n) Q-1(¿) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion, and Q is the complementary Gaussian cumulative distribution function.Abstract:
This paper investigates the maximal channel coding rate achievable at a given blocklength and error probability. For general classes of channels new achievability and converse bounds are given, which are tighter than existing bounds for wide ranges of parameters of interest, and lead to tight approximations of the maximal achievable rate for blocklengths n as short as 100. It is also shown analytically that the maximal rate achievable with error probability ? isclosely approximated by C - ?(V/n) Q-1(?) where C is the capacity, V is a characteristic of the channel referred to as channel dispersion , and Q is the complementary Gaussian cumulative distribution function.read more
Citations
More filters
Posted Content
Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs
TL;DR: It is demonstrated that the main UMP achievability bound can be obtained using coset codes, which suggests a path to implementation of tractable UMP codes.
Posted Content
Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
TL;DR: In this paper, the authors derived security bounds for modified mutual information criterion under the classical and quantum setting, and derived these exponential decreasing rates for secret key generation with error correction, and extended these results to the case when they apply almost dual universal$_2$ hash functions.
Proceedings ArticleDOI
A new converse in rate-distortion theory
Victoria Kostina,Sergio Verdu +1 more
TL;DR: New finite-blocklength converse bounds applicable to lossy source coding as well as joint source-channel coding are shown, which are tight enough not only to prove the strong converse, but to find the rate-dispersion functions in both setups.
Posted Content
Dispersion Analysis of Infinite Constellations in Ergodic Fading Channels.
TL;DR: This thesis considers infinite constellations in fading channels, without power constraint and with perfect channel state information available at the receiver, to hint that in typical cases the unconstrained model can be interpreted as the limit of the constrained model, when the signal to noise ratio tends to infinity.
Journal ArticleDOI
Framework for covert and secret key expansion over classical-quantum channels
TL;DR: In this paper, the authors propose a framework for covert and secret quantum key expansion for fixed and known classical-quantum wiretap channels, and develop and analyze protocols based on forward and reverse reconciliation.
References
More filters
Journal ArticleDOI
A mathematical theory of communication
TL;DR: This final installment of the paper considers the case where the signals or the messages or both are continuously variable, in contrast with the discrete nature assumed until now.
Journal ArticleDOI
An Introduction to Probability Theory and Its Applications
David A. Freedman,William Feller +1 more
An Introduction To Probability Theory And Its Applications
TL;DR: A First Course in Probability (8th ed.) by S. Ross is a lively text that covers the basic ideas of probability theory including those needed in statistics.