Abstract: We derive the channel-coding sphere-packing exponent under a per-codeword cost constraint. The proof is based on hypothesis testing and holds for continuous memoryless channels.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results