Pages that link to "Item:Q5281496"
From MaRDI portal
The following pages link to Channel Coding Rate in the Finite Blocklength Regime (Q5281496):
Displayed 37 items.
- Second-order coding rates for pure-loss bosonic channels (Q291579) (← links)
- On the second-order asymptotics for entanglement-assisted communication (Q332056) (← links)
- Entanglement can increase asymptotic rates of zero-error classical communication over classical channels (Q411372) (← links)
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities (Q522928) (← links)
- Second-order converses via reverse hypercontractivity (Q778887) (← links)
- Fundamental finite key limits for one-way information reconciliation in quantum key distribution (Q1702078) (← links)
- Position-based coding and convex splitting for private communication over quantum channels (Q1702253) (← links)
- A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation (Q1746556) (← links)
- Coordinate invariance as a fundamental constraint on the form of stimulus-specific information measures (Q1799434) (← links)
- Finite blocklength analysis of energy harvesting channels (Q2021834) (← links)
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel (Q2044125) (← links)
- Slow-link adaptation algorithm for multi-source multi-relay wireless networks using best-response dynamics (Q2090234) (← links)
- Properties of noncommutative Rényi and Augustin information (Q2113490) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Semidefinite programming hierarchies for constrained bilinear optimization (Q2149569) (← links)
- Amortized channel divergence for asymptotic quantum channel discrimination (Q2194108) (← links)
- LQG-like control of scalar systems over communication channels: the role of data losses, delays and SNR limitations (Q2342444) (← links)
- Second-order asymptotics for the classical capacity of image-additive quantum channels (Q2354350) (← links)
- Moderate deviation analysis for classical communication over quantum channels (Q2406109) (← links)
- Second-order asymptotics for quantum hypothesis testing (Q2448727) (← links)
- Entropy power inequalities for qudits (Q2814213) (← links)
- Decoding quantum information via the Petz recovery map (Q2820905) (← links)
- Correlation detection and an operational interpretation of the Rényi mutual information (Q2832714) (← links)
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies (Q2948257) (← links)
- Applications of position-based coding to classical communication over quantum channels (Q3120037) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
- Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths (Q5137709) (← links)
- Security analysis of the decoy method with the Bennett–Brassard 1984 protocol for finite key lengths (Q5143230) (← links)
- Worst-case asymmetric distributed function computation (Q5326145) (← links)
- Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)
- Reed-Muller Codes (Q5870775) (← links)
- Novel Fano type lower bounds on the minimum error probability of list $M$-ary hypothesis testing (Q5888338) (← links)
- Discrimination of quantum states under locality constraints in the many-copy setting (Q6057279) (← links)
- Design and decoding of polar codes with large kernels: a survey (Q6137611) (← links)
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources (Q6139507) (← links)
- Quantum information theory in infinite dimensions with application to optical channels (Q6149617) (← links)
- Optimized data rate allocation for dynamic sensor fusion over resource constrained communication networks (Q6177346) (← links)
