On codes satisfying Mth-order running digital sum constraints
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 37 (5) , 1294-1313
- https://doi.org/10.1109/18.133248
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Spectral lines of codes given as functions of finite Markov chainsIEEE Transactions on Information Theory, 1991
- Codes with a multiple spectral null at zero frequencyIEEE Transactions on Information Theory, 1989
- Sliding-block coding for input-restricted channelsIEEE Transactions on Information Theory, 1988
- Spectral Analysis of Functions of Markov Chains with ApplicationsIEEE Transactions on Communications, 1983
- Algorithms for sliding block codes - An application of symbolic dynamics to information theoryIEEE Transactions on Information Theory, 1983
- A General Method for Channel CodingIBM Journal of Research and Development, 1980
- Spectra of Block Coded Digital SignalsIEEE Transactions on Communications, 1974
- The viterbi algorithmProceedings of the IEEE, 1973
- Upper Bound on the Efficiency of dc-Constrained CodesBell System Technical Journal, 1970
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948