Generating functions and lower bounds on rates for limited error-correcting codes
- 1 May 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (3) , 778-788
- https://doi.org/10.1109/18.79947
Abstract
Runlength-limited (RLL) and digital-sum-limited (DSL) codes are considered. For these codes the finite and asymptotic lower bounds on achievable rates for the given minimum Hamming distance are derived. Using generating functions and trellis diagram techniques, the authors prove the existence of RLL- and DSL-codes of rate R and minimum distance d= delta n, such that R>or=2.log lambda /sub 1/(0)-min(log lambda /sub 1/(z)- delta .log z), 0<or=z<or=1, for large enough code length n. The value lambda /sub 1/(z) is the maximum modulus eigenvalue of a certain matrix that is dependent on the limitations and some parameter z. The bounds for the limited codes improve the lower bound of H. C. Ferreira (1984).Keywords
This publication has 9 references indexed in Scilit:
- 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
- On runlength codesIEEE Transactions on Information Theory, 1988
- Combined error correction/Modulation codesIEEE Transactions on Magnetics, 1987
- Lower bounds on the minimum hamming distance achievable with runlengh constrained or DC free block codes and the synthesis of a (16,8) Dmin= 4 DC free block codeIEEE Transactions on Magnetics, 1984
- Information rates and power spectra of digital codesIEEE Transactions on Information Theory, 1982
- 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
- Sequence-state Methods for Run-length-limited CodingIBM Journal of Research and Development, 1970