Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Communication that the ultimate performance of an encoder for a constrained system is limited by the combinatorial capacity of the system if the constraints define a regular language. In the present work, it is shown that this is not an inherent property of regularity but holds in general. To show this, constrained systems are described by generating functions and random walks on trees.
5 pages, to presented at the ISITA 2008 in Auckland, NZ
5 pages, to presented at the ISITA 2008 in Auckland, NZ