Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
Date
2020-01-01
Author
Nakiboğlu, Barış
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
6
views
0
downloads
A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Omega (n(-0.5(1-E'sp)((R)))) for all codes on certain families of channels (including the Gaussian channels and the nonstationary Renyi symmetric channels) and for the constant composition codes on stationary memoryless channels. The resulting nonasymptotic bounds have definite approximation error terms. As a preliminary result that might be of interest on its own, the trade-off between type I and type II error probabilities in the hypothesis testing problem with (possibly non-stationary) independent samples is determined up to some multiplicative constants, assuming that the probabilities of both types of error are decaying exponentially with the number of samples, using the Berry-Esseen theorem.
Subject Keywords
Hypothesis Testing
,
Berry-Esseen Theorem
,
Sphere Packing Bound
,
Augustin İnformation Measures
,
Constant Composition Codes
,
Renyi Symmetry
,
Gaussian Channels
URI
https://hdl.handle.net/11511/48396
Journal
TURKISH JOURNAL OF MATHEMATICS
DOI
https://doi.org/10.3906/mat-1912-106
Collections
Department of Electrical and Electronics Engineering, Article