Concave Programming Upper Bounds on the Capacity of 2-D Constraints

Details Concave Programming Upper Bounds on the Capacity of 2-D Constraints Concave Programming Upper Bounds on the Capacity of 2-D Constraints

2008-01-07

arxiv.org/abs/0801.1126v3

Computer Science

Information Theory

Scientific paper

The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distributions, which is defined by some linear requirements. In this paper, certain aspects of this characterization are extended to 2-D constraints. The result is a method for calculating an upper bound on the capacity of 2-D constraints. The key steps are: The maxentropic stationary probability distribution on square configurations is considered. A set of linear equalities and inequalities is derived from this stationarity. The result is a concave program, which can be easily solved numerically. Our method improves upon previous upper bounds for the capacity of the 2-D ``no independent bits'' constraint, as well as certain 2-D RLL constraints.

Affiliated with

Also associated with

No associations

Rating

Concave Programming Upper Bounds on the Capacity of 2-D Constraints 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 Concave Programming Upper Bounds on the Capacity of 2-D Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Concave Programming Upper Bounds on the Capacity of 2-D Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420414