[图书][B] Channel coding: Non-asymptotic fundamental limits
Y Polyanskiy - 2010 - search.proquest.com
Noise is an inalienable property of all communication systems appearing in nature. Such
noise acts against the very purpose of communication, that is delivery of a data to the …
noise acts against the very purpose of communication, that is delivery of a data to the …
Asymptotic estimates in information theory with non-vanishing error probabilities
VYF Tan - Foundations and Trends® in Communications and …, 2014 - nowpublishers.com
This monograph presents a unified treatment of single-and multi-user problems in
Shannon's information theory where we depart from the requirement that the error …
Shannon's information theory where we depart from the requirement that the error …
Coding in the finite-blocklength regime: Bounds based on Laplace integrals and their asymptotic approximations
T Erseghe - IEEE Transactions on Information Theory, 2016 - ieeexplore.ieee.org
In this paper, we provide new compact integral expressions and associated simple
asymptotic approximations for converse and achievability bounds in the finite blocklength …
asymptotic approximations for converse and achievability bounds in the finite blocklength …
Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors
M Mondelli, SH Hassani… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
Consider the transmission of a polar code of block length and rate over a binary memoryless
symmetric channel and let be the block error probability under successive cancellation …
symmetric channel and let be the block error probability under successive cancellation …
On the dispersions of three network information theory problems
We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf
problem), the multiple-access channel, and the asymmetric broadcast channel. For the two …
problem), the multiple-access channel, and the asymmetric broadcast channel. For the two …
Common information, noise stability, and their extensions
Common information is ubiquitous in information theory and related areas such as
theoretical computer science and discrete probability. However, because there are multiple …
theoretical computer science and discrete probability. However, because there are multiple …
Mismatched decoding: Error exponents, second-order rates and saddlepoint approximations
J Scarlett, A Martinez… - IEEE Transactions on …, 2014 - ieeexplore.ieee.org
This paper considers the problem of channel coding with a given (possibly suboptimal)
maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple …
maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple …
Reed-muller codes
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family
of codes. They are used in many areas of coding theory in both electrical engineering and …
of codes. They are used in many areas of coding theory in both electrical engineering and …
Finite blocklength lossy source coding for discrete memoryless sources
Shannon propounded a theoretical framework (collectively called information theory) that
uses mathematical tools to understand, model and analyze modern mobile wireless …
uses mathematical tools to understand, model and analyze modern mobile wireless …
Channel simulation: Finite blocklengths and broadcast channels
We study channel simulation under common randomness assistance in the finite-
blocklength regime and identify the smooth channel max-information as a linear program …
blocklength regime and identify the smooth channel max-information as a linear program …