Sciweavers

Share
CORR
2008
Springer

Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints

8 years 3 months ago
Maximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
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.
Georg Böcherer, Valdemar Cardoso da Rocha Jr.
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Georg Böcherer, Valdemar Cardoso da Rocha Jr., Cecilio Pimentel
Comments (0)
books