|
This article is cited in 12 scientific papers (total in 12 papers)
Information Theory
The sphere packing bound for memoryless channels
B. Nakiboğlu Middle East Technical University, Ankara, Turkey
Abstract:
Sphere packing bounds (SPBs)—with prefactors that are polynomial in the block length—are derived for codes on two families of memoryless channels using Augustin’s method: (possibly nonstationary) memoryless channels with (possibly multiple) additive cost constraints and stationary memoryless channels with convex constraints on the composition (i.e., empirical distribution, type) of the input codewords. A variant of Gallager’s bound is derived in order to show that these sphere packing bounds are tight in terms of the exponential decay rate of the error probability with the block length under mild hypotheses.
Keywords:
Augustin’s method, sphere packing exponent, error exponent, reliability function,
memoryless channels, Gaussian channels, Poisson channels.
Received: 18.04.2018 Revised: 06.03.2020 Accepted: 29.04.2020
Citation:
B. Nakiboğlu, “The sphere packing bound for memoryless channels”, Probl. Peredachi Inf., 56:3 (2020), 3–49; Problems Inform. Transmission, 56:3 (2020), 201–244
Linking options:
https://www.mathnet.ru/eng/ppi2319 https://www.mathnet.ru/eng/ppi/v56/i3/p3
|
Statistics & downloads: |
Abstract page: | 180 | Full-text PDF : | 20 | References: | 28 | First page: | 16 |
|