DocumentCode
926016
Title
Computation of random coding exponent functions
Author
Arimoto, Suguru
Volume
22
Issue
6
fYear
1976
fDate
11/1/1976 12:00:00 AM
Firstpage
665
Lastpage
671
Abstract
Gallager\´s exponent function 
plays a crucial role in the derivation of bounds for coding error probabilities. An iterative algorithm for computing the maximum of 
over the set of input probability distributions is presented. The algorithm is similar to that of Arimoto and Blahut for computing channel capacity. It is shown that the approximation error is at most inversely proportional to the number of iterations. A similar iterative algorithm for computing the source code reliability-rate function also is presented.
plays a crucial role in the derivation of bounds for coding error probabilities. An iterative algorithm for computing the maximum of over the set of input probability distributions is presented. The algorithm is similar to that of Arimoto and Blahut for computing channel capacity. It is shown that the approximation error is at most inversely proportional to the number of iterations. A similar iterative algorithm for computing the source code reliability-rate function also is presented.Keywords
Coding; Decoding; Source coding; Codes; Communication switching; Iterative algorithms; Packet switching; Probability distribution; Rate distortion theory; Reliability theory; Statistics; Stochastic processes; Writing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1976.1055640
Filename
1055640
Link To Document