Cascade-channel capacity conjecture for finite-state channels
Statement
Let be a state-dependent channel with finite input and output alphabets satisfying . For a channel with memory, let denote its zero-error capacity, let denote the zero-error capacity of the -fold cascade channel, and define
Cascade-channel capacity conjecture. If , so that the channel is finite-state, then the Shannon capacity of the -fold cascade channel converges to as . Conversely, there exist channels with finite input and output alphabets and infinite state space for which the Shannon capacity of the cascade channel converges, as , to a value strictly larger than .
The conjecture distinguishes finite-state channels, where asymptotic cascade capacity is predicted to equal the limiting zero-error capacity, from channels with infinite memory, where a strict separation can occur. The supplied text gives no resolution, so the conjecture remains open.
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.