An algorithm for calculating the channel capacity of degree β

Inder Jeet Taneja; Fernando Guerra

Kybernetika (1985)

  • Volume: 21, Issue: 2, page 123-133
  • ISSN: 0023-5954

How to cite

top

Taneja, Inder Jeet, and Guerra, Fernando. "An algorithm for calculating the channel capacity of degree $\beta $." Kybernetika 21.2 (1985): 123-133. <http://eudml.org/doc/27958>.

@article{Taneja1985,
author = {Taneja, Inder Jeet, Guerra, Fernando},
journal = {Kybernetika},
keywords = {mutual information; capacity of degree beta; upper bounds},
language = {eng},
number = {2},
pages = {123-133},
publisher = {Institute of Information Theory and Automation AS CR},
title = {An algorithm for calculating the channel capacity of degree $\beta $},
url = {http://eudml.org/doc/27958},
volume = {21},
year = {1985},
}

TY - JOUR
AU - Taneja, Inder Jeet
AU - Guerra, Fernando
TI - An algorithm for calculating the channel capacity of degree $\beta $
JO - Kybernetika
PY - 1985
PB - Institute of Information Theory and Automation AS CR
VL - 21
IS - 2
SP - 123
EP - 133
LA - eng
KW - mutual information; capacity of degree beta; upper bounds
UR - http://eudml.org/doc/27958
ER -

References

top
  1. S. Arimoto, Information-theoretical considerations on estimation problems, Inform. and Control 19 (1971), 3, 181-194. (1971) Zbl0222.94022MR0309224
  2. S. Arimoto, An algorithm for computing the capacity of arbitrary discrete memoryless channels, IEEE Trans. Inform. Theory IT-14 (1972), 14-20. (1972) Zbl0227.94011MR0403796
  3. S. Arimoto, Information measures and capacity of order a. for discrete memoryless channels, In: Proc. Colloq. on Inform. Theory, Keszthely (Hungary), 1975, 41-52. (1975) MR0453258
  4. S. Arimoto, Computation of random coding exponent functions, IEEE Trans. Inform. Theory IT-22 (1976), 666-671. (1976) Zbl0349.94036MR0429317
  5. R. E. Blahut, Computation of channel capacity and rate distortion functions, IEEE Trans. Inform. Theory IT-18 (1972), 460-473. (1972) Zbl0247.94017MR0476161
  6. M. C. Cheng, On the computation of capacity of a discrete memoryless channel, Inform. and Control 24 (1974), 292-298. (1974) MR0416751
  7. Z. Daróczy, Generalized information functions, Inform. and Control 16 (1970), 46-51. (1970) MR0272528
  8. R. G. Gallager, Information Theory and Reliable Communications, J. Wiley and Sons, New York 1968. (1968) 
  9. J. Havrda, F. Charvát, Qualification method of classification processes: concept of structural a-entropy, Kybernetika 3 (1967), 1, 30-35. (1967) MR0209067
  10. B. Meister, W. Oettli, On the capacity of a discrete, constant channel, Inform. and Control 11 (1967), 341-351. (1967) Zbl0157.48903
  11. S. Muroga, On the capacity of a discrete channel, I, J. Phys. Soc. Japan 8 (1953), 484 - 494. (1953) MR0058911
  12. A. Rényi, On measures of entropy and information, In: Proc. 4th Berkley Svmp. Math. Statist. Prob., Univ. of Calif. Press, Berkeley, Calif., vol. I (1951), 547-561. (1951) MR0132570
  13. B. D. Sharma, D. P. Mittal, New non-additive measures of entropy for discrete probability distributions, J. Math. Sci. 10 (1975), 28-40. (1975) MR0539493
  14. S. Takano, On a method of calculating the capacity of a discrete memoryless channel, Inform. and Control 29 (1975), 327-336. (1975) Zbl0325.94010MR0389385
  15. I. J. Taneja, D. M. Flemming, An iterative method for calculating the weighted capacity of a discrete constant channel, 13° Colloq. Brasileira de Met., 20-24 July 1982, Pocos de Caldas, MG. (1982) 
  16. I. J. Taneja, M. J. Wanderlinde, An algorithm for computing the generalized γ -capacity of a discrete memoryless channel, J. Inform, and Optim. Sci. 4 (1983), 3, 269 - 282. (1983) MR0718219

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.