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

Authors

G. Böcherer, C. Pimentel, V. C. d. Rocha, R. Mathar,

Abstract

        Using the concept of discrete noiseless channels, it was shown by Shannon in A Mathematical Theory of Com- munication 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.

BibTEX Reference Entry 

@inproceedings{BoPiRoMa08,
	author = {Georg B{\"o}cherer and Cecilio Pimentel and Valdemar Cardoso da Rocha and Rudolf Mathar},
	title = "Maximum Entropy Rate of {M}arkov Sources for Systems With Non-regular Constraints",
	booktitle = "ISITA",
	address = {Auckland, New Zealand},
	month = Dec,
	year = 2008,
	hsb = RWTH-CONV-223586,
	}

Downloads

 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.