An entropy theorem for computing the capacity of weakly (d, k)-constrained sequences

@article{Janssen2000AnET,
  title={An entropy theorem for computing the capacity of weakly (d, k)-constrained sequences},
  author={Augustus J. E. M. Janssen and Kees A. Schouhamer Immink},
  journal={IEEE Trans. Information Theory},
  year={2000},
  volume={46},
  pages={1034-1038}
}
In this correspondence we nd an analytic expression for the maximum of the normalized entropy P i2T pi ln pi= P i2T ipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, P n Pn = 1. This result is applied to the computation of the capacity of weakly (d; k)-constrained sequences that are allowed to… CONTINUE READING