Skip to main content
SpringerLink
Log in

Proof of one inequality in identification theory

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We prove an inequality for the binary L-identification entropy which was conjectured in [1].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Heup, C., L-Identification for Sources, PhD Thesis, Bielefeld University, Germany, 2006. Available at http://pub.uni-bielefeld.de/pub?func=drec&id=2305723.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    V. M. Blinovsky

Authors
  1. V. M. Blinovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. M. Blinovsky.

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

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S003294601202007X

Keywords

Search

Navigation