By Topic

Cascading runlength-limited sequences

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)
Weber, J.H. ; Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands ; Abdel-Ghaffer, K.A.S.

In magnetic or optical storage devices, it is often required to map the data into runlength-limited sequences. To ensure that cascading such sequences does not violate the runlength constraints, a number of merging bits are inserted between two successive sequences. A theory is developed in which the minimum number of merging bits is determined, and the efficiency of a runlength-limited fixed-length coding scheme is considered

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 6 )