The type-2 alignment-set characterization of rate-1/3 feasibility
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 feasibility means that the problem can be solved with broadcast rate . Type-2 alignment-set conjecture. A given index coding problem is rate 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 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.