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 http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86a
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 783Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86a
Abstract
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 |
|---|---|
| Additional Information: | © Copyright 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. |
| Record Number: | CaltechAUTHORS:MCEieeetit86a |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:MCEieeetit86a |
| Alternative URL: | http://ieeexplore.ieee.org/xpls/abs_all.jsp?isnumber=22753&arnumber=1057149&count=32&index=9 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 6921 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Archive Administrator |
| Deposited On: | 02 Jan 2007 |
| Last Modified: | 26 Dec 2012 09:26 |
Repository Staff Only: item control page
