5 problems

Time-average code-length conjecture. The time-average expected codeword lengths should satisfy

Zero-delay coding conjecture. This scheme should achieve the same bitrates predicted by Theorem IV.3(ii) of the source-coding architecture.

For an LQG instance, let $(A_{\mathsf{K}}^\star,B_{\mathsf{K}}^\star,C_{\mathsf{K}}^\star)$ be the solution of the optimal algebraic Riccati equations. The realization is minimal w…

A time-invariant prefix code is used for feedback in a scalar linear-quadratic-Gaussian control system, and an achievability argument establishes near-minimum bitrate performance w…

Bounded-SNR conjecture. The SNR is bounded, and implicit communication may not be crucial for constant-ratio optimality.