Abstract
We prove an inequality for the binary L-identification entropy which was conjectured in [1].
Similar content being viewed by others
References
Heup, C., L-Identification for Sources, PhD Thesis, Bielefeld University, Germany, 2006. Available at http://pub.uni-bielefeld.de/pub?func=drec&id=2305723.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.M. Blinovsky, 2012, published in Problemy Peredachi Informatsii, 2012, Vol. 48, No. 2, pp. 110–112.
Supported in part by the Russian Foundation for Basic Research, project no. 12-01-00905-a, and Bundesministerium für Bilding and Forschung (BMBF), Germany, grant no. Q1BQ1052.
Rights and permissions
About this article
Cite this article
Blinovsky, V.M. Proof of one inequality in identification theory. Probl Inf Transm 48, 182–184 (2012). https://doi.org/10.1134/S003294601202007X
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S003294601202007X