Abstract
For the discrete-time AWGN channel with a power constraint, we give an alternative derivation for the sphere-packing upper bound on the optimal block error exponent and an alternative derivation for the analogous lower bound on the optimal correct-decoding exponent. The derivations use the method of types with finite alphabets of sizes depending on the block length n and with the number of types sub-exponential in n.
Original language | English |
---|---|
Article number | 621 |
Journal | Entropy |
Volume | 27 |
Issue number | 6 |
DOIs | |
State | Published - 11 Jun 2025 |
Bibliographical note
Publisher Copyright:© 2025 by the authors.
Keywords
- channel coding
- correct-decoding
- error exponents
- Gaussian channel
- method of types
- reliability function