ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R∗(D)R^*(D) denote the infimum mutual-information rate over generalized causal reproductions GCR\mathsf{GCR} whose long-term distortion is at most DD, and let R(D)R(D) denote the rate function obtained from the continuous-time linear Gaussian sensor optimization. The paper establishes R∗(D)≤R(D)R^*(D)\leq R(D) for every D>0D>0. Exactness conjecture. The lower bound is attained for every positive distortion level:

R∗(D)=R(D),;D>0.R^*(D)=R(D), \\; D>0.

This would identify the semidefinite-representable function R(D)R(D) with the fundamental performance limitation associated with continuous-time zero-delay source coding. The conjecture is motivated by corresponding discrete-time results, while the text does not report a proof or disproof.

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.