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

Authors
Jansen, AJEM Immink, KAS
Citation
Ajem. Jansen et Kas. Immink, An entropy theorem for computing the capacity of weakly (d, k)-constrainedsequences, IEEE INFO T, 46(3), 2000, pp. 1034-1038
Citations number
3
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
46
Issue
3
Year of publication
2000
Pages
1034 - 1038
Database
ISI
SICI code
0018-9448(200005)46:3<1034:AETFCT>2.0.ZU;2-G
Abstract
In this correspondence we find an analytic expression For the maximum of th e normalized entropy - Sigma(i is an element of T) p(i) ln p(i)/Sigma(i is an element of T) ip(i) where the set T is the disjoint union of sets S-n of positive integers that are assigned probabilities P-n, Sigma(n) P-n = 1. T his result is applied to the computation of the capacity of weakly (d, k)-c onstrained sequences that are allowed to violate the (d, k)-constraint with small probability.