DocumentCode :
905979
Title :
A simple derivation of the coding theorem and some applications
Author :
Gallager, Robert G.
Volume :
11
Issue :
1
fYear :
1965
fDate :
1/1/1965 12:00:00 AM
Firstpage :
3
Lastpage :
18
Abstract :
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 0 and capacity. The results are applied to a number of special channels, including the binary symmetric channel and the additive Gaussian noise channel.
Keywords :
Block codes; Memoryless channels; Additive noise; Block codes; Capacity planning; Channel capacity; Digital modulation; Error probability; Gaussian noise; Helium; Memoryless systems; Modulation coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1965.1053730
Filename :
1053730
Link To Document :
بازگشت