Year: 2025
Type: article
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.
Source: Entropy
DOI: 10.3390/e27060621
Authors: Sergey Tridenski, Anelia Somekh-Baruch
Institution: Bar-Ilan University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $3,137
Funder: Israel Science Foundation
Award: G5932495383
OpenAlex ID: W4411208538
