# A Simple Derivation of the Refined Sphere Packing Bound Under Certain Symmetry Hypotheses

## TL;DR

This paper presents a straightforward derivation of the refined sphere packing bound using Berry-Esseen theorem and information measures, applicable to various channels including Gaussian and non-stationary channels, with explicit non-asymptotic bounds.

## Contribution

It introduces a simple derivation method for the sphere packing bound under symmetry hypotheses, incorporating non-asymptotic bounds with explicit error terms.

## Key findings

- Derived sphere packing bounds with explicit prefactors for certain channels
- Established trade-offs in hypothesis testing error probabilities using Berry-Esseen theorem
- Provided non-asymptotic bounds with concrete approximation errors

## 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 $\mathit{\Omega}\left(n^{-0.5(1-E_{sp}'(R))}\right)$ 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.