By Topic

Efficient code constructions for certain 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

3 Author(s)
Talyansky, R. ; IBM Israel Sci. & Technol. Center, Haifa, Israel ; Etzion, T. ; Roth, R.M.

Efficient encoding algorithms are presented for two types of constraints on two-dimensional binary arrays. The first constraint considered is that of t-conservative arrays, where each row and each column has at least t transitions of the form `0'→`1' or `1'→`0.' The second constraint is that of two-dimensional DC-free arrays, where in each row and each column the number of `0's equals the number of `1's

Published in:

Information Theory, IEEE Transactions on  (Volume:45 ,  Issue: 2 )