Manuscript Psy04-A@1 · Psy04-A-v1.tex · section · d5800e2a
General finite classical capacity
General finite classical capacity · lines 1448–1453
This is a finite Hamming quantization problem. It does not assume that an arbitrary optimal batch partition can be implemented by a -state stream processor.
Nearby in this section
- section: General finite classical capacity
- theorem: Theorem: Exact batch-encoding finite-capacity formulation
- proposition: Proposition: A general covering upper certificate
- section: General finite classical capacity
- proposition: Proposition: Exhaustive certificates versus feasible strategies
- section: General finite classical capacity