ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X[m]=(X1,…,Xm)X_{[m]}=(X_1,\ldots,X_m) be a multiterminal source model with m≥3m\geq 3 terminals. Let omnivocal communication mean communication in which every terminal communicates, and let the singleton partition be the partition {{1},…,{m}}\{\{1\},\ldots,\{m\}\}; write I(X[m])\mathbf{I}(X_{[m]}) for the source-model partition functional and call a partition a minimizer when it attains the minimum of this functional.

Omnivocality conjecture. Omnivocal communication is necessary for achieving SK capacity if and only if the singleton partition is the unique minimizer for I(X[m])\mathbf{I}(X_{[m]}).

This conjecture proposes that the sufficient condition established in the paper exactly characterizes when every terminal must communicate to achieve secret-key capacity. The condition is known to be sufficient in the stated setting, while the paper reports that necessity is proved only for m=3m=3; the general case 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 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.