A GEOMETRIC PROGRAMMING APPROACH TO THE CHANNEL CAPACITY PROBLEM

References

• Arimplo , S. ( 1972 ) An algorithm for computing the capacity of discrete memoryless channels . IEEE Transactions on Information Theory , IT-18 , 14 – 20 .
   Google Scholar
• Ben-Tal , A. and Charnes , A. ( 1979 ) A dual optimization framework for some problems of information theory and statistics . Problems of Control and Information Theory , 8 , 387 – 401 .
   Google Scholar
• Ben-Tal , A. and Teboulle , M. ( 1986 ) Rate distortion theory with generalized information measures via convex programming duality . IEEE Transactions on Information Theory , IT-32 , 630 – 641 .
   Google Scholar
• Ben-Tal , A. and Teboulle , M. ( 1988 ) Extensions of some results for channel capacity using a generalized information measure . Applied Mathematics and Optimization , 17 , 121 – 130 .
   Google Scholar
• Ben-Tal , A. , Teboulle , M. and Charnes , A. ( 1988 ) The role of duality in optimization problems involving entropy functionals with application to information theory . Journal of Optimization Theory and Applications , 58 , 209 – 223 .
   Web of Science ®Google Scholar
• Blahut , E. R. ( 1972 ) Computation of channel capacity and rate-distortion functions . IEEE Transactions on Information Theory , IT-18 , 460 – 473 .
   Web of Science ®Google Scholar
• Cheng , M. C. ( 1974 ) On the computation of capacity of discrete memoryless channels . Information and Control , 24 , 292 – 298 .
   Google Scholar
• Csiszar, 1.( 1972 ) A class of measures of informativity of observation channels . Periodica Math. Hung. , 2 , 191 – 213 .
   Google Scholar
• Csiszar, 1. and Korner , J. ( 1981 ) Information theory; Coding theorems for discrete memoryless systems. Academic Press .
   Google Scholar
• Duffin , R. J. , Peterson , E. L. and Zener , C. ( 1967 ) Geometric programming—Theory and applications John Wiley & Sons .
   Google Scholar
• Duffin , R. J. and Peterson , E. L. ( 1986 ) Optimization and insight by geometric programming . Journal of Applied Physics , 60 , 1860 – 1864 .
   Google Scholar
• Eisenberg , E. ( 1963 ) On channel capacity . Internal Technical Memorandum M-35, Electronics Research Laboratory , University of California , Berkeley .
   Google Scholar
• Fujishige , S. and Zhan , P. :( 1989 ) A dual algorithm for finding the minimum-norm point in a polytope , University of Tsukuba , Institute of Socio-Economic Planning, Discussion Paper Series, No. 410 .
   Google Scholar
• Gallager , R. G. ( 1968 ) Information theory and reliable communication. John Wiley & Sons .
   Google Scholar
• Klafszky , E. ( 1976 ) Geometric programming . Seminary Notes of the Hungarian Committee for System Analysis , No. 11 .
   Google Scholar
• Klafszky , E. , Mayer , J. and Terlaky , T. ( 1989 ) Linearly constrained estimation by mathematical programming . European Journal of Operational Research , 34 , 254 – 267 .
   Google Scholar
• Meistcr , B. and Oettii , W. ( 1967 ) On the capacity of a discrete, constant channel . Information and Control , 11 , 341 – 351 .
   Google Scholar
• Muroga , S. ( 1953 ) On the capacity of a discrete channel . Journal of the Physical Society of Japan , 8 , 484 – 494 .
   Google Scholar
• Scott , C. H. and Jefferson , T. R. ( 1977 ) A generalisation of geometric programming with an application to information theory . Information Sciences , 12 , 263 – 269 .
   Web of Science ®Google Scholar
• Shannon , C. E. ( 1948 ) A mathematical theory of communication . Bell System Technical Journal , 27 379 – 428 .
   Web of Science ®Google Scholar
• Takano , S. ( 1975 ) On a method of calculating the capacity of a discrete memoryless channel . Information and Control , 29 , 327 – 336 .
   Google Scholar