On runlength codes
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (1) , 45-54
- https://doi.org/10.1109/18.2600
Abstract
Several results on binary (d, k) codes are given. First, a novel derivation for the capacity of these codes based on information-theoretic principles is given. Based on this result the spectrum of a (d, k) code is computed. Finally, the problem of computing the capacity of the binary symmetric channel under the condition that the input sequences satisfy the (d, k) constraint is considered. Lower bounds on the capacity of such a channel are derived.<>Keywords
This publication has 1 reference indexed in Scilit:
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948