ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let LL and ss be the parameters of the sliding secure symmetric multilevel diversity coding problem, let XαX_\alpha denote the source associated with level α\alpha, and let H(Xα)H(X_\alpha) be its entropy. For L<2sL<2s, the sum-rate bound is said to be inactive when it does not constrain the admissible rate region. The inactive-bound conjecture. For L<2sL<2s, the sum-rate bound is inactive if

H(Xα−1)α−1<H(Xα)α\frac{H(X_{\alpha-1})}{\alpha-1}<\frac{H(X_{\alpha})}{\alpha}

for some s+1≤α≤Ls+1\leq\alpha\leq L. The preceding result establishes sufficiency of the associated condition, while its necessity is conjectured; no resolution is supplied 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 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.