Channel Coding Rate in the Finite Blocklength Regime

DOI10.1109/TIT.2010.2043769zbMath1366.94312MaRDI QIDQ5281496

Sergio Verdú, H. Vincent Poor, Yury Polyanskiy

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Source coding (94A29)

Related Items (37)

Novel Fano type lower bounds on the minimum error probability of list $M$-ary hypothesis testing ⋮ Tight Approximation Bounds for Maximum Multi-coverage ⋮ Second-order coding rates for pure-loss bosonic channels ⋮ Semidefinite programming hierarchies for constrained bilinear optimization ⋮ On the second-order asymptotics for entanglement-assisted communication ⋮ Worst-case asymmetric distributed function computation ⋮ Moderate deviation analysis for classical communication over quantum channels ⋮ Information Theoretic Security for Encryption Based on Conditional Rényi Entropies ⋮ Discrimination of quantum states under locality constraints in the many-copy setting ⋮ Entanglement can increase asymptotic rates of zero-error classical communication over classical channels ⋮ Amortized channel divergence for asymptotic quantum channel discrimination ⋮ Design and decoding of polar codes with large kernels: a survey ⋮ Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Quantum information theory in infinite dimensions with application to optical channels ⋮ Optimized data rate allocation for dynamic sensor fusion over resource constrained communication networks ⋮ Fundamental finite key limits for one-way information reconciliation in quantum key distribution ⋮ Position-based coding and convex splitting for private communication over quantum channels ⋮ Second-order asymptotics for quantum hypothesis testing ⋮ Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths ⋮ Security analysis of the decoy method with the Bennett–Brassard 1984 protocol for finite key lengths ⋮ A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ⋮ Simple one-shot bounds for various source coding problems using smooth Rényi quantities ⋮ Finite blocklength analysis of energy harvesting channels ⋮ Coordinate invariance as a fundamental constraint on the form of stimulus-specific information measures ⋮ Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel ⋮ Entropy power inequalities for qudits ⋮ Decoding quantum information via the Petz recovery map ⋮ Correlation detection and an operational interpretation of the Rényi mutual information ⋮ Second-order converses via reverse hypercontractivity ⋮ Applications of position-based coding to classical communication over quantum channels ⋮ Slow-link adaptation algorithm for multi-source multi-relay wireless networks using best-response dynamics ⋮ LQG-like control of scalar systems over communication channels: the role of data losses, delays and SNR limitations ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Reed-Muller Codes ⋮ Properties of noncommutative Rényi and Augustin information ⋮ Second-order asymptotics for the classical capacity of image-additive quantum channels ⋮ Tight approximation bounds for maximum multi-coverage

This page was built for publication: Channel Coding Rate in the Finite Blocklength Regime