Refinement's of Pinsker's inequality

被引：101

作者：

Fedotov, AA ^{[1
]}

Harremoës, P

Topsoe, F

机构：

[1] Inst Computat Technol, Dept Informat Technol, Novosibirsk 90, Russia

[2] Univ Copenhagen, Dept Math, DK-2100 Copenhagen, Denmark

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2003年 / 49卷 / 06期

关键词：

divergence; information diagram; Pinsker's inequality; total variation; Vajda's tight lower bound;

D O I：

10.1109/TIT.2003.811927

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Let V and D denote, respectively, total variation and divergence. We study lower bounds of D with V fixed. The theoretically best (i.e, largest) lower bound determines a function L = L(V), Vajda's tight lower bound, cf. Vajda, [1]. The main result is an exact parametrization of L. This leads to Taylor polynomials which are lower bounds for L, and thereby to extensions of the classical Pinsker inequality which has numerous applications, cf. Pinsker [2] and followers.

引用

页码：1491 / 1498

页数：8

共 22 条

[1]

[Anonymous], USPEHI MATEM NAUK

[2] ENTROPY AND THE CENTRAL-LIMIT-THEOREM [J].

BARRON, AR .

ANNALS OF PROBABILITY, 1986, 14 (01) :336-342

[3]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[4]

Csiszar I, 1967, STUD SCI MATH HUNG, V2, P299

[5]

Csiszar I., 1966, STUD SCI MATH HUNG, V1, P185

[6] Inequalities between entropy and index of coincidence derived from information diagrams [J].

Harremoës, P ;

Topsoe, F .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :2944-2960

[7]

HARREMOES P, 2003, PREPRINT SERIES U CO, V2

[8] SUFFICIENCY, KMS CONDITION AND RELATIVE ENTROPY IN VONNEUMANN-ALGEBRAS [J].

HIAI, F ;

OHYA, M ;

TSUKADA, M .

PACIFIC JOURNAL OF MATHEMATICS, 1981, 96 (01) :99-109

[9] ON EXPONENTIAL BOUNDS FOR BINOMIAL PROBABILITIES [J].

KAMBO, NS ;

KOTZ, S .

ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 1966, 18 (03) :277-&

[10] ON OPTIMUM RATE OF TRANSMITTING INFORMATION [J].

KEMPERMAN, JH .

ANNALS OF MATHEMATICAL STATISTICS, 1969, 40 (06) :2156-+

← 1 2 3 →