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

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

Two-dimensional binary patterns that satisfy one-dimensional (d, k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd,k is defined as Cd,k=limm,n→∞log2Nm,n d,k/mn, where Nm,nd,k denotes the number of m×n rectangular patterns that satisfy the two-dimensional (d,k) run-length constraint. Bounds on Cd,k are given and it is proven for every d⩾1 and every k>d that Cd,k=0 if and only if k=d+1. Encoding algorithms are also discussed

Published in:

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

Date of Publication:

Jul 1999

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.