The Case I achievable-rate conjecture for two-sender unicast index coding
Statement
Let , , be a side-information digraph whose sub-digraphs , , have any type of interaction, either fully participated or partially participated, for any . Let denote the broadcast rate for -bit messages, where is any finite positive integer. The Case I achievable-rate conjecture. For some ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.