Ahlswede–Han conjecture on capacity with rate-limited state information

About 20 years old · traced to

Consider a state-dependent channel p(y∣x,s)p(y|x,s) with independent and identically distributed state SnS^n, where the receiver obtains rate-limited state information through a separate communication link of rate R0R_0. Let S^\hat{S} be an auxiliary random variable generated from SS according to p(s^∣s)p(\hat{s}|s). Ahlswede–Han conjecture. The capacity is

C(R0)=max⁡I(X;Y∣S^),C(R_0)=\max I(X;Y|\hat{S}),

where the maximum is over joint distributions of the form p(x)p(s)p(y∣x,s)p(s^∣s)p(x)p(s)p(y|x,s)p(\hat{s}|s) satisfying

I(S;S^∣Y)≤R0,I(S;\hat{S}|Y)\le R_0,

with ∣S^∣≤∣S∣+1|\hat{\mathcal{S}}|\le |\mathcal{S}|+1. The paper states that its main theorem confirms this conjecture in the special case where the state is a deterministic function of the channel input and output; thus the conjecture is resolved for that special case, while the general claim is not established here.

References

Primary source

Thomas M. Cover and Young-Han Kim, “Capacity of a Class of Deterministic Relay Channels”, arXiv:cs/0611053 (2006).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.