Tightness conjecture for the MAP conditional-entropy bound
Statement
Let denote the normalized conditional entropy in the code ensemble, and let and be the degree sequences appearing in Theorem 1. For each admissible random variable , let be the corresponding trial-entropy functional. Under the hypotheses of Theorem 1, tightness conjecture.
where the supremum is taken over the space of admissible random variables, with the degree sequences used as arguments of fixed to be those of Theorem 1. The conjecture asserts that the upper bound from Theorem 1 is asymptotically tight; establishing equality requires optimizing the trial entropy over all admissible random variables.
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.