ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Dk\mathcal{D}^k, k∈{13,14,⋯ ,25}k \in \{13,14,\cdots,25\}, be a side-information digraph whose sub-digraphs Dik,P\mathcal{D}_{i}^{k,\mathcal{P}}, i∈{1,2,3}i \in \{1,2,3\}, have any type of interaction, either fully participated or partially participated, for any P\mathcal{P}. Let βt(Dk,P)\beta_t(\mathcal{D}^k,\mathcal{P}) denote the broadcast rate for tt-bit messages, where tt is any finite positive integer. The Case I achievable-rate conjecture. For some ϵ∈{−2,−1,0}\epsilon \in \{-2,-1,0\},

βt(Dk,P)=βt(D1k,P)+βt(D2k,P)+βt(D3k,P)+ϵ/t.\beta_t(\mathcal{D}^k,\mathcal{P})=\beta_t(\mathcal{D}_{1}^{k,\mathcal{P}})+\beta_t(\mathcal{D}_{2}^{k,\mathcal{P}})+\beta_t(\mathcal{D}_{3}^{k,\mathcal{P}})+\epsilon/t.

This conjecture, stated in the cited prior work, predicts the broadcast rate for the indicated two-sender unicast index-coding instances from the rates of their three single-sender sub-problems. Its resolution is not established in the supplied text.

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.