ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider the Poisson channel

x[t]≥0⟶y[t]∼Pois⁡(x[t]),x[t] \geq 0 \quad \longrightarrow \quad y[t] \sim \operatorname{Pois}(x[t]),

with power constraint 1n∑t=1nx[t]≤nα\tfrac{1}{n}\sum_{t=1}^n x[t] \leq n^\alpha. This is the Poisson channel with increasing power (PCIP). A normalized rate ρ>0\rho>0 is achievable if, for every ϵ>0\epsilon>0, one can design a code for some blocklength nn with error probability at most ϵ\epsilon and rate ρlog⁡n\rho\log n; let Cˉ(α)\bar C(\alpha) be the closure of achievable normalized rates. PCIP capacity conjecture. For the PCIP, Cˉ(α)=α/2\bar C(\alpha)=\alpha/2. This characterizes the maximum achievable normalized rate when the power constraint grows polynomially with the blocklength; the supplied text does not establish the claim's resolution.

Record

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.