Abstract
The technique of dynamic programming is employed to find the number of subevents into which each event of a finite generalised probability scheme should be divided so as to optimize the expressions for entropies given by Shannon, Renyi and the author. Attention is drawn to a new class of non-linear integer programming problems which arise during the course of the discussion.
Similar content being viewed by others
References
Shannon, C. E...Bell. System Tech. J., 1948,27, 379 and 623.
Khinchin, A. I. ..Math. Found. Inf. Theory, Dover Publications, 1956.
Fadeev, D. K. ..Uspchi Mat. Nauk (N.S.),2, 227.
Feinstein, A. ..Found. Inf. Theory, McGraw-Hill, 1958.
Schutzenberger, M. P. ..Third London Symp. Inf. Theory, Butterworths, 1955.
Lee, P. N...Ann. Math. Stat., 1964,35, 425.
Renyi, A...Proc. 4th Berkeley Symp. Math. Stat., 1961,1, 547.
Varma, R. S...Ganita, 1965,16, 1.
----- ..Journ. Math. Sci. Delhi, 1966,1.
----- .. “Presidential address,”Ind. Math. Soc., 1966,18.
Kapur, J. N. ..Math. Seminar, 1967,4.
----- ..Bannerji 75th Birth Annversary Volume, 1967.
----- ..Ind. Journ. Math., 1967,9.
Bellman, R. ..Dynamic Programming, Princeton U. Press, 1957.
-- and Dreyfus, S. E.Applied Dynamic Programming, Princeton U. Press, 1961.
Reza, F. M. ..Introd. Inf. Theory, McGraw-Hill, 1961.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kapur, J.N. On some applications of dynamic programming to information theory. Proc. Indian Acad. Sci. 67, 1–11 (1968). https://doi.org/10.1007/BF03049928
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF03049928