Skip to main content

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

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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

Authors

Editor information

Editors and Affiliations

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