Exact finite-energy fundamental limit for deterministic no-feedback AWGN coding
Statement
Consider the real additive white Gaussian noise sequence channel
where the noise coordinates are independent . An code has equiprobable messages, a deterministic encoder with codewords satisfying
no feedback, and an arbitrary decoder with average block error probability at most . There is no restriction on the number of channel uses or nonzero coordinates.
Polyanskiy and Wu observed in Remark 21.2 of Information Theory: From Coding to Learning that pulse-position modulation can be improved by subtracting its common center of gravity and rescaling, producing a regular simplex code. They conjectured that this simplex code is the actual optimal code achieving for every fixed and .
Equivalently, for , does the full-energy regular -simplex minimize the required total energy among all deterministic, equiprobable, no-feedback AWGN codes satisfying the maximal per-codeword energy constraint?
Record
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.