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
Correlation detection and an operational interpretation of the Rényi mutual information
TL;DR: This work shows that the Rényi mutual information attains operational significance in the context of composite hypothesis testing, when the null hypothesis is a fixed bipartite state and the alternate hypothesis consists of all product states that share one marginal with thenull hypothesis.
Posted Content
Throughput of Cognitive Radio Systems with Finite Blocklength Codes
Gozde Ozcan,M. Cenk Gursoy +1 more
TL;DR: Throughput achieved in cognitive radio channels with finite blocklength codes in the presence of buffer constraints is studied and a state-transition model for the cognitive radio channel is constructed.
Journal ArticleDOI
Upper bounds on secret-key agreement over lossy thermal bosonic channels
Eneet Kaur,Mark M. Wilde +1 more
TL;DR: A recent advance in the theory of the teleportation simulation of single-mode phase-insensitive Gaussian channels is extended such that it now applies to the relative entropy of entanglement measure, and tighter upper bounds are found on the non-asymptotic secret-key-agreement capacity of the lossy thermal bosonic channel than were previously known.
Journal ArticleDOI
On the power of PPT-preserving and non-signalling codes
Debbie Leung,William Matthews +1 more
TL;DR: It is found that codes that are non-signalling and PPT-preserving can be strictly less powerful than codes satisfying either one of the constraints, and therefore provide a tighter bound for unassisted codes.
Polarization and Spatial Coupling: Two Techniques to Boost Performance
TL;DR: P polarization and spatial coupling are investigated and fundamental laws that govern the behavior of po-larization and polar codes are derived, which play a fundamental role also in computer science and statistical physics.
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.