Binary-alphabet conjecture for the optimal auxiliary random variable
Statement
Let be the auxiliary random variable in the feedback-based collaborative secrecy encoding problem over binary symmetric channels. The preceding result establishes that can be restricted without loss of optimality to a three-dimensional alphabet. Binary-alphabet conjecture. The optimal auxiliary random variable can be defined, without loss of optimality, over a binary alphabet. If true, this would reduce the search for the boundary of the achievable common-message and secret-message rate region to binary auxiliary variables; the supplied text presents arguments supporting the conjecture but does not state a resolution.
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.