ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let UU be the auxiliary random variable in the feedback-based collaborative secrecy encoding problem over binary symmetric channels. The preceding result establishes that UU can be restricted without loss of optimality to a three-dimensional alphabet. Binary-alphabet conjecture. The optimal auxiliary random variable UU 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.