ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the real additive white Gaussian noise sequence channel

Y=X+Z,Y=X+Z,

where the noise coordinates are independent N(0,N0/2)N(0,N_0/2). An (E,M,ϵ)(E,M,\epsilon) code has MM equiprobable messages, a deterministic encoder with codewords c1,…,cM∈ℓ2c_1,\ldots,c_M\in\ell_2 satisfying

∥ci∥2≤E(1≤i≤M),\|c_i\|^2\le E \qquad(1\le i\le M),

no feedback, and an arbitrary decoder with average block error probability at most ϵ\epsilon. 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 E∗(k,ϵ)E^*(k,\epsilon) for every fixed kk and ϵ\epsilon.

Equivalently, for M=2kM=2^k, does the full-energy regular (M−1)(M-1)-simplex minimize the required total energy among all deterministic, equiprobable, no-feedback AWGN codes satisfying the maximal per-codeword energy constraint?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.