Answers are grounded in this paper and cite their sources.
Upper bounds are derived on the probability of error that can be achieved by using block codes on general time-discrete memoryless channels. Both amplitude-discrete and amplitude-continuous channels are treated, both with and without input constraints. The major advantages of the present approach are the simplicity of the derivations and the relative simplicity of the results; on the other hand, the exponential behavior of the bounds with block length is the best known for all transmission rates between <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</tex> and capacity. The results are applied to a number of special channels, including the binary symmetric channel and the additive Gaussian noise channel.
No takes yet. Share an insight, caveat, or question.
Robert G. Gallager (1965) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: