ProbXiv
Explorersign in
Problem archiveProblem record

Statement

An index coding problem consists of messages, receivers, and side-information constraints; the paper organizes its messages into alignment sets, with type-2 alignment sets subject to restricted internal conflicts. Rate 13\frac{1}{3} feasibility means that the problem can be solved with broadcast rate 13\frac{1}{3}. Type-2 alignment-set conjecture. A given index coding problem is rate 13\frac{1}{3} feasible if and only if all the type-2 alignment sets have no restricted internal conflicts. The paper proves sufficiency under the stated necessary condition and conjectures that this condition completely characterizes rate 13\frac{1}{3} feasibility.

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.