On the Capacity of Constrained Systems


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


        In the first chapter of Shannon’s A Mathematical
Theory of Communication, it is shown that the maximum entropy
rate of an input process of a constrained system is limited by the
combinatorial capacity of the system. Shannon considers systems
where the constraints define regular languages and uses results
from matrix theory in his derivations. In this work, the regularity
constraint is dropped. Using generating functions, it is shown that
the maximum entropy rate of an input process is upper-bounded
by the combinatorial capacity in general. The presented results
also allow for a new approach to systems with regular constraints.
As an example, the results are applied to binary sequences that
fulfill the (j, k) run-length constraint and by using the proposed
framework, a simple formula for the combinatorial capacity is
given and a maxentropic input process is defined.

BibTEX Reference Entry 

	author = {Georg B{\"o}cherer and Valdemar Cardoso da Rocha and Cecilio Pimentel and Rudolf Mathar},
	title = "On the Capacity of Constrained Systems",
	booktitle = "International ITG Conference on Source and Channel Coding (SCC)",
	address = {Siegen},
	month = Jan,
	year = 2010,
	hsb = hsb910015885,


 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.