Limits RegistryPUBLIC RECORDLimits RegistryResearch Console →Shannon capacity of a finite discrete memoryless channel.
The question, scope, and sources behind this Registry record.
Determine the supremum reliable communication rate over a stationary finite-alphabet discrete memoryless channel.
Current frontiers derived from accepted Claims.
The accepted equality closes this optimization result.
Assertions tied to evidence, attribution, and review.
The frontier as it changed over time.
Only accepted Claims matching the current specification contribute to the displayed bounds. Strict inequalities remain open; contradictory Claims require editorial review.