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
Journal ArticleDOI
Entropy power inequalities for qudits
TL;DR: In this article, De Palma, Mari, and Giovannetti showed a quantum analogue of Shannon's entropy power inequality for continuous-variable quantum systems, where X and Y are replaced by bosonic fields and the addition rule is the action of a beam splitter with transmissivity a on those fields.
Journal ArticleDOI
Tight Bound on Relative Entropy by Entropy Difference
David Reeb,Michael M. Wolf +1 more
TL;DR: A lower bound on the relative entropy between two finite-dimensional states is proved in terms of their entropy difference and the dimension of the underlying space, and the inequality is tight in the sense that equality can be attained for any prescribed value of the entropy difference.
Proceedings ArticleDOI
Limits of low-probability-of-detection communication over a discrete memoryless channel
TL;DR: This paper considers the problem of communication over a discrete memoryless channel subject to the constraint that the probability that an adversary who observes the channel outputs can detect the communication is low.
Journal ArticleDOI
Bayesian $M$ -Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight
TL;DR: Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived and help to identify the steps where existing converse bounds are loose.
Journal ArticleDOI
Joint Frame Design and Resource Allocation for Ultra-Reliable and Low-Latency Vehicular Networks
TL;DR: In this article, the authors investigate the frame design and resource allocation for an urban V2V URLLC system in which the uplink cellular resources are reused at the underlay mode.
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.