ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DKD_K be a KK-IC\mathsf{IC} structure, and let t≥1t\geq 1 be the number of bits in each message. Write ℓICC(DK)\ell_{\mathsf{ICC}}(D_K) for the scalar linear index-code length of the ICC\mathsf{ICC} scheme, and let β(DK)\beta(D_K) and βt(DK)\beta_t(D_K) denote the corresponding index-coding broadcast rates. ICC optimality conjecture. For messages of any t≥1t\geq 1 bits and any KK-IC\mathsf{IC} structure DKD_K, the scalar linear index code given by the ICC\mathsf{ICC} scheme is optimal, i.e.,

ℓICC(DK)=β(DK)=βt(DK).\ell_{\mathsf{ICC}}(D_K)=\beta(D_K)=\beta_t(D_K).

The theorem in the paper proves this for a specified class of KK-IC\mathsf{IC} structures, and a proposition proves it for K∈{1,2,3}K\in\{1,2,3\}; the conjecture extends optimality to all KK-IC\mathsf{IC} structures.

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.