Information Spectrum Approach to Second-Order Coding Rate in Channel Coding

Abstract

Second-order coding rate of channel coding is discussed for general sequence of channels. The optimum second-order transmission rate with a constant error constraint $\epsilon$ is obtained by using the information spectrum method. We apply this result to the discrete memoryless case, the discrete memoryless case with a cost constraint, the additive Markovian case, and the Gaussian channel case with an energy constraint. We also clarify that the Gallager bound does not give the optimum evaluation in the second-order coding rate.

References in corpus (2)

• Practical Evaluation of Security for Quantum Key Distribution
• Experimental Decoy State Quantum Key Distribution with Unconditional Security Incorporating Finite Statistics

Cited by in corpus (119)

• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
• Second-order asymptotics for quantum hypothesis testing
• The Third-Order Term in the Normal Approximation for the AWGN Channel
• On the Dispersions of Three Network Information Theory Problems
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
• Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages
• A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
• Quantum Coding with Finite Resources
• Entropy accumulation with improved second-order term
• Security analysis of the decoy method with the Bennett-Brassard 1984 protocol for finite key lengths
• Tight exponential analysis of universally composable privacy amplification and its applications
• Semidefinite programming strong converse bounds for classical capacity
• Quantum Channel Simulation and the Channel's Smooth Max-Information
• Operational Interpretation of Renyi Information Measures via Composite Hypothesis Testing Against Product and Markov Distributions
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• On the Second-Order Asymptotics for Entanglement-Assisted Communication
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• Non-asymptotic entanglement distillation
• Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
• Semidefinite programming converse bounds for quantum communication
• Second-Order Coding Rates for Channels with State
• Quantum Achievability Proof via Collision Relative Entropy
• Fundamental Finite Key Limits for One-Way Information Reconciliation in Quantum Key Distribution
• Variable-length Convolutional Coding for Short Blocklengths with Decision Feedback
• Moderate deviation analysis for classical communication over quantum channels
• Applications of position-based coding to classical communication over quantum channels
• Finite-length Analysis on Tail probability for Markov Chain and Application to Simple Hypothesis Testing
• Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
• Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
• Second-Order Resolvability, Intrinsic Randomness, and Fixed-Length Source Coding for Mixed Sources: Information Spectrum Approach
• Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
• Decoding quantum information via the Petz recovery map
• Optimal performance of generalized heat engines with finite-size baths of arbitrary multiple conserved quantities beyond i.i.d. scaling
• A Finite-Blocklength Perspective on Gaussian Multi-Access Channels
• Non-Asymptotic Classical Data Compression with Quantum Side Information
• On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength
• Second-Order Region for Gray-Wyner Network
• Second-Order Asymptotics for the Gaussian MAC with Degraded Message Sets
• Semidefinite programming hierarchies for constrained bilinear optimization
• On Finite Blocklength Lossy Source Coding
• A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels
• Algorithmic Aspects of Optimal Channel Coding
• On the Reliability Function of the Discrete Memoryless Relay Channel
• Polar Codes' Simplicity, Random Codes' Durability
• On Refined Versions of the Azuma-Hoeffding Inequality with Applications in Information Theory
• The variance of relative surprisal as single-shot quantifier
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
• Moderate deviation expansion for fully quantum tasks
• Duality of channels and codes
• Second-order coding rates for key distillation in quantum key distribution
• Efficient evaluation of the error probability for pilot-assisted URLLC with Massive MIMO
• Second-order coding rates for pure-loss bosonic channels
• The Sphere Packing Bound via Augustin's Method
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
• Wiretap Channels: Nonasymptotic Fundamental Limits
• Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality
• Secret Key Agreement: General Capacity and Second-Order Asymptotics
• Finite-Length Analyses for Source and Channel Coding on Markov Chains
• Channel Simulation: Finite Blocklengths and Broadcast Channels
• First-Passage Time and Large-Deviation Analysis for Erasure Channels with Memory
• Wiretap Secret Key Capacity of Tree-PIN
• Second-Order Converses via Reverse Hypercontractivity
• Universal channel coding for general output alphabet
• Strong Converse and Second-Order Asymptotics of Channel Resolvability
• The Second-Order Coding Rate of the MIMO Rayleigh Block-Fading Channel
• Finite-Block-Length Analysis in Classical and Quantum Information Theory
• Scaling Exponent and Moderate Deviations Asymptotics of Polar Codes for the AWGN Channel
• Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
• Variable-Length Source Dispersions Differ under Maximum and Average Error Criteria
• On the Scaling Exponent of Polar Codes for Binary-Input Energy-Harvesting Channels
• Non-Asymptotic Analysis of Privacy Amplification via Renyi Entropy and Inf-Spectral Entropy
• Second Order Analysis for Joint Source-Channel Coding with Markovian Source
• Comprehensive Analysis on Exact Asymptotics of Random Coding Error Probability
• Equivocations, Exponents and Second-Order Coding Rates under Various Rényi Information Measures
• Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
• Fixed Error Asymptotics For Erasure and List Decoding
• Exact Asymptotics for the Random Coding Error Probability
• Optimality of meta-converse for channel simulation
• First- and Second-Order Hypothesis Testing for Mixed Memoryless Sources with General Mixture
• Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel
• Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems
• Smoothing Brascamp-Lieb Inequalities and Strong Converses for Common Randomness Generation
• Twin-Timescale Radio Resource Management for Ultra-Reliable and Low-Latency Vehicular Networks
• Semi-Finite Length Analysis for Information Theoretic Tasks
• Scaling Exponent of List Decoders with Applications to Polar Codes
• Finite-Blocklength Bounds for Wiretap Channels
• Asymptotic Expansions for Gaussian Channels with Feedback under a Peak Power Constraint
• Refinement of the Sphere-Packing Bound: Asymmetric Channels
• Joint Frame Design and Resource Allocation for Ultra-Reliable and Low-Latency Vehicular Networks
• Leveraging Linear Quadratic Regulator Cost and Energy Consumption for Ultra-Reliable and Low-Latency IoT Control Systems
• Quantum channel coding: Approximation algorithms and strong converse exponents
• Attainability of quantum state discrimination bounds with collective measurements on finite copies
• Analytical calculation formulas for capacities of classical and classical-quantum channels
• On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding
• Exponential Strong Converse for Content Identification with Lossy Recovery
• Empirical Output Distribution of Good Delay-Limited Codes for Quasi-Static Fading Channels
• Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability
• First- and Second-Order Coding Theorems for Mixed Memoryless Channels with General Mixture
• Finite-Sample Analysis of Image Registration
• Moderate-Deviations of Lossy Source Coding for Discrete and Gaussian Sources
• Second-Order Asymptotically Optimal Statistical Classification
• New Converse Bounds for Discrete Memoryless Channels in the Finite Blocklength Regime
• A Case Where Interference Does Not Affect The Channel Dispersion
• New Non-asymptotic Random Channel Coding Theorems
• The Mutual Information In The Vicinity of Capacity-Achieving Input Distributions
• Optimum ratio between two bases in Bennett-Brassard 1984 protocol with second order analysis
• Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information
• Channel Resolvability Theorems for General Sources and Channels
• Overflow Probability of Variable-length Codes with Codeword Cost
• Second Order and Moderate Deviation Analysis of a Block Fading Channel with Deterministic and Energy Harvesting Power Constraints
• Channels with cost constraints: strong converse and dispersion
• A Simple Technique for the Converse of Finite Blocklength Multiple Access Channels
• Partial Strong Converse for the Non-Degraded Wiretap Channel
• Interactive Communication for Data Exchange
• A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel with Feedback
• Second-Order Asymptotics for the Discrete Memoryless MAC with Degraded Message Sets
• On Dispersions of Discrete Memoryless Channels with Noncausal State Information at the Encoder