Finite-Block-Length Analysis in Classical and Quantum Information Theory
arXiv:1605.02821 · doi:10.2183/pjab.93.007
Abstract
Coding technology is used in several information processing tasks. In particular, when noise during transmission disturbs communications, coding technology is employed to protect the information. However, there are two types of coding technology: coding in classical information theory and coding in quantum information theory. Although the physical media used to transmit information ultimately obey quantum mechanics, we need to choose the type of coding depending on the kind of information device, classical or quantum, that is being used. In both branches of information theory, there are many elegant theoretical results under the ideal assumption that an infinitely large system is available. In a realistic situation, we need to account for finite size effects. The present paper reviews finite size effects in classical and quantum information theory with respect to various topics, including applied aspects.
References in corpus (42)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Decoy State Quantum Key Distribution
- Quantum Key Distribution with High Loss: Toward Global Secure Communication
- Beating the PNS attack in practical quantum cryptography
- Practical Decoy State for Quantum Key Distribution
- Distillation of secret key and entanglement from quantum states
- Tight Finite-Key Analysis for Quantum Cryptography
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Leftover Hashing Against Quantum Side Information
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- Exponential decreasing rate of leaked information in universal random privacy amplification
- Practical issues in quantum-key-distribution post-processing
- A decoy-state protocol for quantum cryptography with 4 intensities of coherent states
- Fixed-length lossy compression in the finite blocklength regime
- Universal Secure Network Coding via Rank-Metric Codes
- Second-order asymptotics for quantum hypothesis testing
- On the Dispersions of Three Network Information Theory Problems
- An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
- Upper bounds of eavesdropper's performances in finite-length code with decoy method
- 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
- More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- 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
- Practical Evaluation of Security for Quantum Key Distribution
- Tomography increases key rates of quantum-key-distribution protocols
- General theory for decoy-state quantum key distribution with arbitrary number of intensities
- Dual universality of hash functions and its applications to quantum cryptography
- Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information
- Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
- Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
- Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
- Exact minimum and maximum of yield with a finite number of decoy light intensities
- Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels
- Secure Multiplex Network Coding
- Strongly Secure Privacy Amplification Cannot Be Obtained by Encoder of Slepian-Wolf Code
- One-way Quantum Key Distribution System based on Planar Lightwave Circuits
- Asymptotic Compatibility between LOCC Conversion and Recovery
- Optimal decoy intensity for decoy quantum key distribution
- Optimal ratio between phase basis and bit basis in QKD