By Topic

Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels

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
$33 $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)
A. Kato ; Dept. of Math. Eng. & Inf. Phys., Tokyo Univ., Japan ; K. Zeger

A binary sequence satisfies a one-dimensional (d,k) run length constraint if every run of zeros has length at least d and at most k. A two-dimensional binary pattern is (d1,k1,d2 ,k2)-constrained if it satisfies the one-dimensional (d 1,k1) run length constraint horizontally and the one-dimensional (d2,k2) run length constraint vertically. For given d1, k1, d2, and k 2, the asymmetric two-dimensional capacity is defined as C d1,k1,d2,k2=limm,n→∞ (1/(mn)) log2 Nm,n(d1,k1,d2,k2) where Nm,n(d1,k1,d2,k2) denotes the number of (d1 ,k1,d2,k2)-constrained m×n binary patterns. We determine whether the capacity is positive or is zero, for many choices of (d1,k1,d2,k 2)

Published in:

IEEE Transactions on Information Theory  (Volume:46 ,  Issue: 7 )