ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let hnh_n denote the normalized conditional entropy in the code ensemble, and let τ\tau and ρ\rho be the degree sequences appearing in Theorem 1. For each admissible random variable VV, let ϕV\phi_V be the corresponding trial-entropy functional. Under the hypotheses of Theorem 1, tightness conjecture.

lim⁡n→∞hn=sup⁡V,ϕV,\lim_{n\to\infty}h_n=\sup_V\\,\phi_V,

where the supremum is taken over the space of admissible random variables, with the degree sequences used as arguments of ϕV\phi_V 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.