The intrinsic-capacity decomposition conjecture
Statement
Let be a channel and let denote its convex decompositions. For , write for the corresponding capacity quantity, for the lower intrinsic capacity, and and for the associated rank probabilities. Intrinsic-capacity decomposition conjecture. If
then
The conjecture asserts that a decomposition attaining the lower intrinsic capacity also attains the extremal rank probability at ; this would identify the decomposition needed to achieve the lower bound discussed in the surrounding results. Its resolution is not specified in the source.
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.