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

A.J.E.M. Janssen; K.A. Schouhamer Immink

doi:10.1109/18.841180

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

A.J.E.M. Janssen
, K.A. Schouhamer Immink

Research output: Contribution to journal › Article › Academic › peer-review

5 Citations (Scopus)

253 Downloads (Pure)

Abstract

We find an analytic expression for the maximum of the normalized entropy -SieTpiln pi/SieTipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, SnPn =1. This result is applied to the computation of the capacity of weakly (d,k)-constrained sequences that are allowed to violate the (d,k)-constraint with small probability

Original language	English
Pages (from-to)	1034-1038
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	46
Issue number	3
DOIs	https://doi.org/10.1109/18.841180
Publication status	Published - 2000
Externally published	Yes

Access to Document

10.1109/18.841180

Metis235366Final published version, 180 KB

Cite this

@article{13d114d5320e44289e29d7fc4f84cc6c,

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

abstract = "We find an analytic expression for the maximum of the normalized entropy -SieTpiln pi/SieTipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, SnPn =1. This result is applied to the computation of the capacity of weakly (d,k)-constrained sequences that are allowed to violate the (d,k)-constraint with small probability",

author = "A.J.E.M. Janssen and \{Schouhamer Immink\}, K.A.",

year = "2000",

doi = "10.1109/18.841180",

language = "English",

volume = "46",

pages = "1034--1038",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "3",

}

TY - JOUR

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

AU - Janssen, A.J.E.M.

AU - Schouhamer Immink, K.A.

PY - 2000

Y1 - 2000

N2 - We find an analytic expression for the maximum of the normalized entropy -SieTpiln pi/SieTipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, SnPn =1. This result is applied to the computation of the capacity of weakly (d,k)-constrained sequences that are allowed to violate the (d,k)-constraint with small probability

AB - We find an analytic expression for the maximum of the normalized entropy -SieTpiln pi/SieTipi where the set T is the disjoint union of sets Sn of positive integers that are assigned probabilities Pn, SnPn =1. This result is applied to the computation of the capacity of weakly (d,k)-constrained sequences that are allowed to violate the (d,k)-constraint with small probability

U2 - 10.1109/18.841180

DO - 10.1109/18.841180

M3 - Article

SN - 0018-9448

VL - 46

SP - 1034

EP - 1038

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

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

Abstract

Access to Document

Fingerprint

Cite this