Cart (Loading....) | Create Account
Close category search window
 

Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays

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)
Etzion, T. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; Paterson, K.G.

A binary sequence satisfies a one-dimensional$(d_1, k_1, d_2, k_2)$runlength constraint if every run of zeros has length at least$d_1$and at most$k_1$and every run of ones has length at least$d_2$and at most$k_2$. A two-dimensional binary array is$(d_1, k_1, d_2, k_2; d_3, k_3, d_4, k_4)$-constrained if it satisfies the one-dimensional$(d_1, k_1, d_2, k_2)$runlength constraint horizontally and the one-dimensional$(d_3, k_3, d_4, k_4)$runlength constraint vertically. For given$d_1, k_1, d_2, k_2, d_3, k_3, d_4, k_4$, the two-dimensional capacity is defined as $$displaylines C(d_1, k_1, d_2, k_2; d_3, k_3, d_4, k_4) hfillcr hfill=, lim_m,n rightarrow infty log_2 N(m, n ,vert, d_1, k_1, d_2, k_2; d_3, k_3, d_4, k_4)over mn $$ where $$N(m, n ,vert, d_1, k_1, d_2, k_2; d_3, k_3, d_4, k_4)$$ denotes the number of$m times n$binary arrays that are$(d_1, k_1, d_2, k_2; d_3, k_3, d_4, k_4)$-constrained. Such constrained systems may have applications in digital storage applications. We consider the question for which values of$d_i$and$k_i$is the capacity$C(d_1, k_1, d_2, k_2; d_3, k_3, d_4, k_4)$positive and for which values is the capacity zero. The question is answered for many choices of the$d_i$and the$k_i$.

Published in:

Information Theory, IEEE Transactions on  (Volume:51 ,  Issue: 9 )

Date of Publication:

Sept. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.