A simple derivation of the refined sphere packing bound under certain symmetry hypotheses

DOI10.3906/mat-1912-106zbMath1458.94006arXiv1904.12780OpenAlexW3106230902MaRDI QIDQ4970859

B. Nakiboğlu

Publication date: 7 October 2020

Published in: TURKISH JOURNAL OF MATHEMATICS (Search for Journal in Brave)

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

zbMATH Keywords

hypothesis testingGaussian channelssphere packing boundBerry-Esseen theoremconstant composition codesAugustin information measuresRenyi symmetry

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Related Items

The sphere packing bound for memoryless channels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement of convergence rate estimates in the Lyapunov theorem
• On the sphere-packing bound, capacity, and similar results for Poisson channels
• The Augustin capacity and center
• The sphere packing bound for memoryless channels
• Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law
• Rényi Divergence and Kullback-Leibler Divergence
• Refinement of the Sphere-Packing Bound: Asymmetric Channels
• On Deviations of the Sample Mean
• An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
• A lower bounding method for channel and source coding probabilities
• On the reliability function of the ideal Poisson channel with noiseless feedback
• 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
• On the reliability exponent of the exponential timing channel
• On Exact Asymptotics of the Error Probability in Channel Coding: Symmetric Channels
• Error Probability Bounds for Gaussian Channels Under Maximal and Average Power Constraints
• 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
• The Accuracy of the Gaussian Approximation to the Sum of Independent Variates
• Information Theory