Bounds and constructions for runlength-limited error-control block codes
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 789-800
- https://doi.org/10.1109/18.79948
Abstract
Block codes satisfying (d,k) constraints are studied. These runlength-limited codes are useful for strong data in magnetic recording devices. Since most devices are noisy, the codes are often required to have some error-control capability. The authors consider codes that can detect or correct symmetric, asymmetric, or bit-shift errors. Explicit construction methods for error-detecting codes are presented. Upper bounds on the sizes of error-correcting codes based on sphere packing arguments are derived. The construction methods and the upper bounds improve upon the best known results concerning optimal runlength-limited error-control block codes.Keywords
This publication has 10 references indexed in Scilit:
- Magnetic and optical storage systems: opportunities for communications technologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Lower bounds on achievable rates for limited bitshift correcting codesIEEE Transactions on Information Theory, 1994
- Upper bounds on error-correcting runlength-limited block codesIEEE Transactions on Information Theory, 1991
- Runlength-limited sequencesProceedings of the IEEE, 1990
- A general error-correcting code construction for run-length limited binary channelsIEEE Transactions on Information Theory, 1989
- Error detecting multiple block (d,k) codesIEEE Transactions on Magnetics, 1989
- Recording codes for digital magnetic storageIEEE Transactions on Magnetics, 1985
- Analysis of Correctable Errors in the IBM 3380 Disk FileIBM Journal of Research and Development, 1984
- Optimal asymmetric error detecting codesInformation and Control, 1982
- On the theory of binary asymmetric error correcting codesInformation and Control, 1979