Tightness of the communication-rate upper bounds for hypergraphical sources
Statement
Let be a hypergraphical source, and let denote the minimum communication rate required to achieve secret-key capacity. Theorem~ gives an upper bound on this rate for general hypergraphical sources, while Theorem~ gives the corresponding upper bound for pairwise independent network sources on weighted graphs. Tightness conjecture. The upper bounds in Theorems~ and are tight. This conjecture asserts that the displayed upper bounds exactly equal the communication rates needed to achieve secret-key capacity; the source does not provide a resolution.
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.