The capacity formula conjecture for strictly positive channels
Statement
Let be a strictly positive discrete memoryless channel (DMC), let and denote the empirical distributions of the input and output sequences, and let denote the set of probability distributions on . Write for the rank of the channel matrix. Capacity formula conjecture. For any strictly positive DMC ,
where the supremum is over all probability distributions in , or equivalently over all probability distributions of . This would extend the paper's closed-form capacity result from strictly positive full-rank DMCs to general strictly positive DMCs; its resolution is not established here.
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.