ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let WW be a channel from [ ⁣[1,2] ⁣][\![1,2]\!] to [ ⁣[1,n] ⁣][\![1,n]\!], and let S\mathcal{S} be the state space. Suppose

W=∑s∈SpS(s)K(s),W=\sum_{s\in\mathcal{S}}p_S(s)K^{(s)},

where SS denotes the channel state. Causal state-information uselessness conjecture. If, for every 1≤j≤n1\leq j\leq n, the two entries K1,j(s)K^{(s)}_{1,j} and K2,j(s)K^{(s)}_{2,j} have an order—either K1,j(s)≤K2,j(s)K^{(s)}_{1,j}\leq K^{(s)}_{2,j} for all ss, or K1,j(s)≥K2,j(s)K^{(s)}_{1,j}\geq K^{(s)}_{2,j} for all ss—independent of ss, then causal state information available at the encoder cannot increase the capacity of WW.

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.