Abstract
Several new results on binary (d,k) codes are given. First, a new derivation for the capacity of these codes based upon information theoretic principles is given. Based upon 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.
| Original language | English |
|---|---|
| Pages (from-to) | 45-54 |
| Number of pages | 10 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 34 |
| Issue number | 1 |
| DOIs | |
| State | Published - Jan 1988 |
| Externally published | Yes |
Bibliographical note
Funding Information:Manuscript received June 12, 1986; revised April 9, 1987. This work was supported in part by the Center for Magnetic Recording Research, University of California, San Diego. This paper was presented in part at the IEEE International Symposium on Information Theory, Ann Arbor, MI, October 5-9, 1986.
Funding
Manuscript received June 12, 1986; revised April 9, 1987. This work was supported in part by the Center for Magnetic Recording Research, University of California, San Diego. This paper was presented in part at the IEEE International Symposium on Information Theory, Ann Arbor, MI, October 5-9, 1986.
| Funders | Funder number |
|---|---|
| University of California, San Diego |