By Topic

Improved bit-stuffing bounds on two-dimensional constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Halevy, S. ; Comput. Sci. Dept., Technion-Israel Inst. of Technol., Haifa, Israel ; Jiangxin Chen ; Roth, R.M. ; Siegel, P.H.
more authors

We derive lower bounds on the capacity of certain two-dimensional (2-D) constraints by considering bounds on the entropy of measures induced by bit-stuffing encoders. A more detailed analysis of a previously proposed bit-stuffing encoder for (d,∞)-runlength-limited (RLL) constraints on the square lattice yields improved lower bounds on the capacity for all d ≥ 2. This encoding approach is extended to (d,∞)-RLL constraints on the hexagonal lattice, and a similar analysis yields lower bounds on the capacity for d ≥ 2. For the hexagonal (1,∞)-RLL constraint, the exact coding ratio of the bit-stuffing encoder is calculated and is shown to be within 0.5% of the (known) capacity. Finally, a lower bound is presented on the coding ratio of a bit-stuffing encoder for the constraint on the square lattice where each bit is equal to at least one of its four closest neighbors, thereby providing a lower bound on the capacity of this constraint.

Published in:

Information Theory, IEEE Transactions on  (Volume:50 ,  Issue: 5 )