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

Enumeration algorithms for constructing (d1, ∞, d2, ∞) run length limited arrays: capacity estimates and coding schemes

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)
Srinivasa, S. ; Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; McLaughlin, S.W.

We present two enumeration algorithms for a class of (d1, ∞, d2, ∞) run-length limited (RLL) constrained arrays. Based on the structure of these algorithms, we derive bounds for the maximum information rate of the constraint. We also give encoders and decoders for coded 2D constrained arrays with rates close to the derived bounds.

Published in:

Information Theory Workshop, 2004. IEEE

Date of Conference:

24-29 Oct. 2004

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.