The Sphere Packing Bound via Augustin’s Method

DOI10.1109/TIT.2018.2882547MaRDI QIDQ4615343zbMATH OpenOpenAlexWikidataFDO

Authors B. Nakiboğlu

Publication date 28 January 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Measures of information, entropy (94A17) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Linear codes (general theory) (94B05)

Abstract: A sphere packing bound (SPB) with a prefactor that is polynomial in the block length $n$ is established for codes on a length $n$ product channel $W_{[1,n]}$ assuming that the maximum order $1/2$ Renyi capacity among the component channels, i.e. $ma{x}_{tin[1,n]}{C}_{1/2,W_t}$, is $mathitO(lnn)$. The reliability function of the discrete stationary product channels with feedback is bounded from above by the sphere packing exponent. Both results are proved by first establishing a non-asymptotic SPB. The latter result continues to hold under a milder stationarity hypothesis.

Cited in

(5)

• The sphere packing bound for memoryless channels
• The Augustin capacity and center
• Augmented lagrangians and sphere packing problems
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• Properties of noncommutative Rényi and Augustin information

This page was built for publication: The Sphere Packing Bound via Augustin’s Method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615343)