Channel Coding Rate in the Finite Blocklength Regime
From MaRDI portal
Cited in
(48)- 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
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation
- Coordinate invariance as a fundamental constraint on the form of stimulus-specific information measures
- Finite blocklength analysis of energy harvesting channels
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
- Slow-link adaptation algorithm for multi-source multi-relay wireless networks using best-response dynamics
- Properties of noncommutative Rényi and Augustin information
- Tight approximation bounds for maximum multi-coverage
- Semidefinite programming hierarchies for constrained bilinear optimization
- Amortized channel divergence for asymptotic quantum channel discrimination
- LQG-like control of scalar systems over communication channels: the role of data losses, delays and SNR limitations
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Moderate deviation analysis for classical communication over quantum channels
- Second-order asymptotics for quantum hypothesis testing
- 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 coding rates for pure-loss bosonic channels
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies
- Moderate Deviations in Channel Coding
- Applications of position-based coding to classical communication over quantum channels
- On the second-order asymptotics for entanglement-assisted communication
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
- On the Relation of OSTBC and Code Rate One QSTBC: Average Rate, BER, and Coding Gain
- scientific article; zbMATH DE number 820505 (Why is no real title available?)
- Tight approximation bounds for maximum multi-coverage
- 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
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities
- Minimum Rate Coding for LTI Systems Over Noiseless Channels
- Worst-case asymmetric distributed function computation
- Common Information, Noise Stability, and Their Extensions
- Reed-Muller Codes
- Novel Fano type lower bounds on the minimum error probability of list M-ary hypothesis testing
- Discrimination of quantum states under locality constraints in the many-copy setting
- 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
- Quantum Rényi and f-divergences from integral representations
- Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
- Error exponent of activated non-signaling-assisted classical-quantum channel coding
- Unsourced random access
- A negative binomial approximation in group testing
- Twenty questions with random error
- Channel simulation: theory and applications to lossy compression and differential privacy
- Second-order converses via reverse hypercontractivity
This page was built for publication: Channel Coding Rate in the Finite Blocklength Regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281496)
