Lower bounds to error probability for coding on discrete memoryless channels. Part II¶
Robert G. Gallager Claude E. Shannon, E. R. B. (1967). Lower bounds to error probability for coding on discrete memoryless channels. Part II.
Cited by¶
2 citations across 1 artifact.
Domain-specific¶
- Elias Bassalygo bound
- The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.
- … directly demonstrates that alphabet, block length, Hamming distance, relative distance, rate, ball or sphere radius, asymptotic regime, entropy convention, and bound formula are explicit. to An applied instance preserves the same invariant under a changed scale, notation, jurisdiction, dataset, or implementation..
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:6cf545a31dcc · see in the full table