On the Capacity of Constrained Systems

Details On the Capacity of Constrained Systems On the Capacity of Constrained Systems

2009-11-05

arxiv.org/abs/0911.1090v2

Computer Science

Information Theory

6 pages, to be presented at SCC 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Capacity of Constrained Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Capacity of Constrained Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Capacity of Constrained Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-418677