Article information

2003 , Volume 8, ¹ 5, p.3-13

Fedotov A.A., Harremoes P., Topsoe F.

Best Pinsker Bound Equals Taylor Polynomial of Degree 49

An exact parametrization of Vajda's tight lower bound, [Java Applet] allows to construct refined Pinsker bounds [Java Applet] that is recursively defined polynomials of degree [Java Applet] which fit the inequality [Java Applet]. We show that [Java Applet] coincides with Taylor polynomial of degree [Java Applet] approximating [Java Applet] in zero iff [Java Applet] is less or equal to 49.

[full text] Classificator Msc2000:
*62B10 Information-theoretic topics
62H30 Classification and discrimination; cluster analysis
94A15 Information theory, general

Keywords: information stability of random variables, optimum rate of transmitting information, lower bound for discrimination information in terms of variation, bounds for entropy

Author(s):
Fedotov Aleksei Anatolievich
Address: 630090, Russia, Moscow
E-mail: alexei.fedotov@gmail.com

Harremoes P.
Address: DK-2100, Denmark, Copenhagen
E-mail: moes@math.ku.dk

Topsoe F.
Address: DK-2100, Denmark, Copenhagen
E-mail: topsoe@math.ku.dk


Bibliography link:
Fedotov A.A., Harremoes P., Topsoe F. Best Pinsker Bound Equals Taylor Polynomial of Degree 49 // Computational technologies. 2003. V. 8. ¹ 5. P. 3-13
Home| Scope| Editorial Board| Content| Search| Subscription| Rules| Contacts
ISSN 1560-7534
© 2024 FRC ICT