CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
A Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses
Authors
Baris Nakiboglu
Publication date
1 January 2020
Publisher
'The Scientific and Technological Research Council of Turkey'
Doi
Cite
View
on
arXiv
Abstract
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
Ω
(
n
−
0.5
(
1
−
E
s
p
′
(
R
)
)
)
\mathit{\Omega}\left(n^{-0.5(1-E_{sp}'(R))}\right)
Ω
(
n
−
0.5
(
1
−
E
s
p
′
​
(
R
))
)
for all codes on certain families of channels -- including the Gaussian channels and the non-stationary Renyi symmetric channels -- and for the constant composition codes on stationary memoryless channels. The resulting non-asymptotic 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.Comment: 20 page
Similar works
Full text
Available Versions
OpenMETU (Middle East Technical University)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:https://open.metu.edu.tr:1...
Last time updated on 02/12/2021