By Topic

Entropy of Bit-Stuffing-Induced Measures for Two-Dimensional Checkerboard 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

2 Author(s)
Forchhammer, S. ; Res. Center COM, Tech. Univ. of Denmark, Lyngy ; Laursen, T.V.

A modified bit-stuffing scheme for two-dimensional (2-D) checkerboard constraints is introduced. The entropy of the scheme is determined based on a probability measure defined by the modified bit-stuffing. Entropy results of the scheme are given for 2-D constraints on a binary alphabet. The constraints considered are 2-D RLL(d,infin) for d=2,3 and 4 as well as for the constraint with a minimum 1-norm distance of 3 between 1s. For these results the entropy is within 1-2% of an upper bound on the capacity for the constraint. As a variation of the scheme, periodic merging arrays are also considered

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 4 )