A Caltech Library Service

An entropy maximization problem related to optical communication

McEliece, Robert J. and Rodemich, Eugene R. and Swanson, Laif (1986) An entropy maximization problem related to optical communication. IEEE Transactions on Information Theory, 32 (2). pp. 322-326. ISSN 0018-9448. doi:10.1109/TIT.1986.1057149.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


Motivated by a problem in optical communication, we consider the general problem of maximizing the entropy of a stationary random process that is subject to an average transition cost constraint. Using a recent result of Justenson and Hoholdt, we present an exact solution to the problem and suggest a class of finite state encoders that give a good approximation to the exact solution.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 1986 IEEE. Reprinted with permission. Manuscript received October 18, 1984; revised June 3, 1985. This work was supported in part by the National Aeronautics and Space Administration under Contract NAS7-100. This work was partially presented at the 17th Annual Conference on Information Sciences and Systems, Johns Hopkins University, Baltimore, MD, March 1983.
Funding AgencyGrant Number
Issue or Number:2
Record Number:CaltechAUTHORS:MCEieeetit86a
Persistent URL:
Official Citation:R. McEliece, E. Rodemich and L. Swanson, "An entropy maximization problem related to optical communication (Corresp.)," in IEEE Transactions on Information Theory, vol. 32, no. 2, pp. 322-326, March 1986. doi: 10.1109/TIT.1986.1057149
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:6921
Deposited By: Archive Administrator
Deposited On:02 Jan 2007
Last Modified:08 Nov 2021 20:38

Repository Staff Only: item control page