Manuscript Psy04-A@1 · Psy04-A-v1.tex · section · d5800e2a

General finite classical capacity

General finite classical capacity · lines 1409–1414

Let $X$ be uniform on ${0, 1}^{n}$ , and let the late query $J$ be independent and uniform on ${1, \dots, n}$ . Allow $K \geq 1$ classical memory values.

Nearby in this section

theorem: Theorem: Exact batch-encoding finite-capacity formulation
section: General finite classical capacity
proposition: Proposition: A general covering upper certificate
section: General finite classical capacity
proposition: Proposition: Exhaustive certificates versus feasible strategies
section: General finite classical capacity