Skip to main content
Springer Nature Link
Log in

Identification for Sources

  • Chapter
General Theory of Information Transfer and Combinatorics

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4123))

  • 1936 Accesses

Abstract

The classical transmission problem deals with the question how many possible messages can we transmit over a noisy channel? Transmission means there is an answer to the question “What is the actual message?” In the identification problem we deal with the question how many possible messages the receiver of a noisy channel can identify? Identification means there is an answer to the question “Is the actual message u?” Here u can be any member of the set of possible messages.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shannon, C.E.: A mathematical theory of communication. Bell Syst. Techn. J. 27, 379–423, 623–656 (1948)

    Google Scholar 

  2. Huffman, D.A.: A method for the construction of minimum redundancy codes. In: Proc. IRE, vol. 40, pp. 1098–1101 (1952)

    Google Scholar 

  3. Ahlswede, R., Dueck, G.: Identification via channels. IEEE Trans. Inf. Theory 35(1), 15–29 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ahlswede, R.: General theory of information transfer, Preprint 97–118, SFB 343, Diskrete Strukturen in der Mathematik, Universität Bielefeld (1997); General theory of information transfer:updated, General Theory of Information Transfer and Combinatorics, a Special Issue of Discrete Applied Mathematics (to appear)

    Google Scholar 

  5. Ahlswede, R., Csiszár, I.: Common randomness in Information Theory and Cryptography, Part II: CR capacity. IEEE Trans. Inf. Theory 44(1), 55–62 (1998)

    Article  Google Scholar 

  6. Campbell, C.C.: Definition of entropy by means of a coding problem. Z. Wahrscheinlichkeitstheorie u. verw. Geb., 113–119 (1966)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    R. Ahlswede

  2.  

    B. Balkenhol & C. Kleinewächter

Authors
  1. R. Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. Balkenhol
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Kleinewächter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik, Universität Bielefeld, 100131, 33501, Bielefeld, Germany

    Rudolf Ahlswede

  2. Fakultät für Mathematik, Universität Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Lars Bäumer , Ning Cai , Harout Aydinian  & Christian Deppe , ,  & 

  3. Russian Academy of Sciences Institute of Problems of Information Transmission, Bol’shoi Karetnyi per. 19, 101447, Moscow, Russia

    Vladimir Blinovsky

  4. Universität Bielefeld, Fakultät für Mathematik, Universitätsstr. 25, 33615, Bielefeld, Germany

    Haik Mashurian

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ahlswede, R., Balkenhol, B., Kleinewächter, C. (2006). Identification for Sources. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_4

Download citation

  • DOI: https://doi.org/10.1007/11889342_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46244-6

  • Online ISBN: 978-3-540-46245-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics