Proof of one inequality in identification theory

DOI10.1134/S003294601202007XzbMATH Open1302.94023OpenAlexW2047213245MaRDI QIDQ375958FDOQ375958

Vladimir Blinovsky

Publication date: 1 November 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s003294601202007x

Recommendations

• On an inequality for the entropy of a probability distribution
• scientific article; zbMATH DE number 1983989
• Inductive proof of an important inequality (Corresp.)
• Two new results for identification for sources
• An inequality for the binary entropy function and an application to binomial coefficients

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• Inductive proof of an important inequality (Corresp.)

This page was built for publication: Proof of one inequality in identification theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q375958)