The sphere packing bound for memoryless channels

DOI10.1134/S0032946020030011zbMath1458.94196arXiv1804.06372OpenAlexW3104519130MaRDI QIDQ2211175

B. Nakiboğlu

Publication date: 12 November 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.06372

zbMATH Keywords

reliability functionerror exponentGaussian channelsmemoryless channelsAugustin's methodPoisson channelssphere packing exponent

Mathematics Subject Classification ID

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

Related Items (2)

A simple derivation of the refined sphere packing bound under certain symmetry hypotheses ⋮ Properties of noncommutative Rényi and Augustin information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random coding bounds for discrete memoryless channels
• On the reliability function for a quantum communication channel.
• On the sphere-packing bound, capacity, and similar results for Poisson channels
• The Augustin capacity and center
• Refinement of the Random Coding Bound
• Rényi Divergence and Kullback-Leibler Divergence
• Mismatched Decoding: Error Exponents, Second-Order Rates and Saddlepoint Approximations
• Refinement of the Sphere-Packing Bound: Asymmetric Channels
• Capacity and error exponent for the direct detection photon channel. II
• A lower bounding method for channel and source coding probabilities
• Hypothesis testing and information theory
• Information bounds of the Fano-Kullback type
• Moderate Deviation Analysis for Classical-Quantum Channels and Quantum Hypothesis Testing
• Constant Compositions in the Sphere Packing Bound for Classical-Quantum Channels
• The Sphere Packing Bound via Augustin’s Method
• The Rényi Capacity and Center
• Optimal Transmit Strategy for MISO Channels With Joint Sum and Per-Antenna Power Constraints
• Real Analysis and Probability
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• Quantum Sphere-Packing Bounds With Polynomial Prefactors
• Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels
• A simple derivation of the coding theorem and some applications
• Error estimates for low rate codes
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Asymptotic Estimates of the Probability of Error for Transmission of Messages over a Discrete Memoryless Communication Channel with a Symmetric Transition Probability Matrix
• Information Theory

This page was built for publication: The sphere packing bound for memoryless channels