Published June 26, 2022
| Submitted
Book Section - Chapter
Open
Third-order Analysis of Channel Coding in the Moderate Deviations Regime
Chicago
Abstract
The channel coding problem in the moderate deviations regime is studied; here, the error probability sub-exponentially decays to zero, and the rate approaches the capacity slower than O(1/√n). The main result refines Altuğ and Wagner's moderate deviations result by deriving lower and upper bounds on the third-order term in the asymptotic expansion of the maximum achievable message set size. The third-order term of the expansion employs a new quantity called the channel skewness. For the binary symmetric channel and most practically important (n,ϵ) pairs, including n ∈ [100, 500] and ϵ ∈ [10⁻¹⁰,10⁻¹], an approximation up to the channel skewness is the most accurate among several expansions in the literature.
Additional Information
© 2022 IEEE. This work was supported in part by the National Science Foundation (NSF) under grant CCF-1817241 and CCF-1956386.Attached Files
Submitted - 2203.01418.pdf
Files
2203.01418.pdf
Files
(585.8 kB)
Name | Size | Download all |
---|---|---|
md5:cc5e11f0e4913726e128b2f302c89925
|
585.8 kB | Preview Download |
Additional details
- Eprint ID
- 116087
- Resolver ID
- CaltechAUTHORS:20220804-765685000
- NSF
- CCF-1817241
- NSF
- CCF-1956386
- Created
-
2022-08-04Created from EPrint's datestamp field
- Updated
-
2022-08-04Created from EPrint's last_modified field