Summary
The paper is concerned with the assignment of input probabilities to achieve the maximum rate of transmission when the transition matrix is prespecified. Unlike the standard reference [Muroga, 1953], in whichLagrange multipliers are used in conventional form, mathematical programming approach has been proposed.
Zusammenfassung
Die Zuordnung von Eingabe-Wahrscheinlichkeiten zur Erzielung einer maximalen Übertragungsrate bei vorgegebenen Übergangswahrscheinlichkeiten wird untersucht. Entgegen der Behandlung unter Verwendung vonLagrangeschen Multiplikatoren [Muroga, 1953] wird hier der Zugang mit Hilfe konvexer Programmierung betrachtet.
Similar content being viewed by others
References
Arrow, K. J., andA. C. Enthoven: Quasi-Concave Programming, Econometrica,29, 1961, 779–800.
Charnes, A., andW. W. Cooper: Programming with Linear Fractional Functionals, Nav. Res. Log. Quart.,9, 1962, 181–186.
Dinkelbach, W.: On Non-linear Fractional Programming, Manag. Sc.,13, 1967, 492–498.
Martos, B.: The direct power of adjacent vertex programming methods, Manag. Sc.,12, 1965, 241–252.
Meister, B., andW. Oettli: On the capacity of a discrete constant channel, Information and Control,11, 1967, 341–351.
Muroga, S.: On the capacity of a Discrete Channel, J. Phys. Soc. Japan,8, 1953, 484–494.
Reza, F. M.: An Introduction to Information Theory, New York 1961.
Swarup, K.: Programming with Quadratic Fractional Functional, Opsearch,2, 1965, 23–29.
Zoutendijk, G.: Methods of Feasible Directions. A Study in Linear and Non-linear Programming, Amsterdam 1960.
Author information
Authors and Affiliations
Additional information
Vorgel. v.:J. Nitsche
Rights and permissions
About this article
Cite this article
Aggarwal, S.P., Sharma, I.C. Maximization of the transmission rate of a discrete, constant channel. Unternehmensforschung Operations Research 14, 152–155 (1970). https://doi.org/10.1007/BF01918259
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01918259