Cascading runlength-limited sequences
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (6) , 1976-1984
- https://doi.org/10.1109/18.265507
Abstract
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 consideredKeywords
This publication has 6 references indexed in Scilit:
- Runlength-limited sequencesProceedings of the IEEE, 1990
- A general error-correcting code construction for run-length limited binary channelsIEEE Transactions on Information Theory, 1989
- Recording codes for digital magnetic storageIEEE Transactions on Magnetics, 1985
- A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)IEEE Transactions on Information Theory, 1983
- Channel capacity of charge-constrained run-length limited codesIEEE Transactions on Magnetics, 1981
- Block codes for a class of constrained noiseless channelsInformation and Control, 1970