By Topic

Nested block decodable runlength-limited codes

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

3 Author(s)
J. Hogan ; Hewlett-Packard Co., Palo Alto, CA, USA ; R. M. Roth ; G. Ruckenstein

Consider a (d1, k1)-runlength-limited (RLL) constraint that is contained in a (d2, k2)-RLL constraint, where k1⩾2d1 and d2>0, and fix a codeword length q>k2. It is shown that whenever there exist block-decodable encoders with codeword length q for those two constraints, there exist such encoders where one is a subgraph of the other: furthermore, both encoders can be decoded by essentially the same decoder. Specifically, a (d1, k1 )-RLL constrained word is decoded by first using a block decoder of the (d2, k2)-RLL encoder, and then applying a certain function to the output of that decoder

Published in:

IEEE Transactions on Information Theory  (Volume:47 ,  Issue: 4 )