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

Simple item page
dc.creatorBöcherer, Georg
dc.creatorRocha Jr., Valdemar Cardoso da
dc.creatorPimentel, Cecilio
dc.date2008-09-07
dc.date.accessioned2026-07-07T10:01:21Z
dc.date.available2026-07-07T10:01:21Z
dc.descriptionUsing 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.
dc.description5 pages, to presented at the ISITA 2008 in Auckland, NZ
dc.identifierhttps://arxiv.org/abs/0809.1252
dc.identifierhttp://arxiv.org/abs/0809.1252
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168604
dc.subjectInformation Theory
dc.titleMaximum Entropy Rate of Markov Sources for Systems With Non-regular Constraints
dc.typetext

Files

Collections

arXiv