Upper bounds on error-correcting runlength-limited 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) , 941-945
- https://doi.org/10.1109/18.79965
Abstract
Upper bounds are derived on the number of codewords in error-correcting (d,k)-constrained block codes. The author focuses on simple error-correcting schemes, such as single-error correction, since the recording channels on which these codes are used usually have a very low bit error rate. Multierror-correcting codes with a relatively short block length are not practical, since a high code rate is a major concern. The notation of a (d,k)-constrained block code is discussed. The concept of combined codes is introduced, several bounds are derived, and several examples are given.Keywords
This publication has 10 references indexed in Scilit:
- Bounds and constructions for runlength-limited error-control block codesIEEE Transactions on Information Theory, 1991
- Runlength-limited codes for mixed-error channelsIEEE Transactions on Information Theory, 1991
- A general error-correcting code construction for run-length limited binary channelsIEEE Transactions on Information Theory, 1989
- Coding techniques for the noisy magnetic recording channel: a state-of-the-art reportIEEE Transactions on Communications, 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
- A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)IEEE Transactions on Information Theory, 1983
- Algorithms for sliding block codes - An application of symbolic dynamics to information theoryIEEE Transactions on Information Theory, 1983
- Block codes for a class of constrained noiseless channelsInformation and Control, 1970
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948