ICC optimality conjecture for K-IC structures
Statement
Let be a - structure, and let be the number of bits in each message. Write for the scalar linear index-code length of the scheme, and let and denote the corresponding index-coding broadcast rates. ICC optimality conjecture. For messages of any bits and any - structure , the scalar linear index code given by the scheme is optimal, i.e.,
The theorem in the paper proves this for a specified class of - structures, and a proposition proves it for ; the conjecture extends optimality to all - 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.