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
Quantum Sphere-Packing Bounds with Polynomial Prefactors.
TL;DR: In this article, the optimal error probability for classical coding over classical-quantum channels at rates below the capacity was studied, and the authors showed that these two exponents admit a variational representation and are related by the Golden Thompson inequality.
Journal ArticleDOI
Average Rate and Error Probability Analysis in Short Packet Communications Over RIS-Aided URLLC Systems
TL;DR: In this article, the average achievable rate and error probability of a reconfigurable intelligent surface (RIS) aided system is investigated for the finite blocklength (FBL) regime, and the performance loss due to the presence of phase errors arising from limited quantization levels as well as hardware impairments at the RIS elements is also discussed.
Journal ArticleDOI
Probability-Based Ordered-Statistics Decoding for Short Block Codes
TL;DR: This letter proposes an efficient probability-based ordered-statistics decoding (PB-OSD) algorithm for short block-length codes that significantly reduces the decoding complexity under the same error performance, compared to the original OSD algorithm.
Proceedings ArticleDOI
Strong converse and second-order asymptotics of channel resolvability
Shun Watanabe,Masahito Hayashi +1 more
TL;DR: In this article, the authors studied the problem of channel resolvability for fixed i.i.d. input distributions and discrete memoryless channels, and derived the strong converse theorem for any DMCs that are not necessarily full rank.
Journal ArticleDOI
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths
TL;DR: A design method to obtain better QC PBRL code families at short block-lengths for low frame error rate (FER) requirements and establishes an equivalence between the exhaustive search to design a new row for the PBRL protomatrix according to the new design method and an integer linear program.
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.