The causal state-information uselessness conjecture for binary-input channels
Statement
Let be a channel from to , and let be the state space. Suppose
where denotes the channel state. Causal state-information uselessness conjecture. If, for every , the two entries and have an order—either for all , or for all —independent of , then causal state information available at the encoder cannot increase the capacity of .
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.