Skip to main content
SpringerLink
Log in

Identification via Channels

  • Chapter
  • First Online:
Identification and Other Probabilistic Models

Part of the book series: Foundations in Signal Processing, Communications and Networking ((SIGNAL,volume 16))

Abstract

Contrasting to Shannon’s classical coding scheme for the transmission of a message over a noisy channel in the theory of identification the decoder is not really interested in what the received message is, but he only wants to decide whether a message, which is of special interest to him, had been sent or not. If the sender knows this certain message, this is a trivial problem. He just transmits one bit over the channel, namely “Yes, my message is the same as your message” or “No, it is not”. However, if he does not know this message or if there are several receivers, each one interested in different messages, this is not possible. So there is need for a different method. There are also algorithmic problems where it is not necessary to calculate the solution, but only to check whether a certain given answer is correct. Depending on the problem, this answer might be much easier to give than finding the solution. “Easier” in this context means using less resources like channel usage, computing time or storage space.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. R. Ahlswede, Coloring hypergraphs: a new approach to multi-user source coding, part I. J. Combin. Inform. Syst. Sci. 4(1), 76–115 (1979)

    MATH  Google Scholar 

  2. R. Ahlswede, A method of coding and an application to arbitrarily varying channels. J. Comb. Inf. Syst. Sci. 5(1), 10–35 (1980)

    MathSciNet  Google Scholar 

  3. R. Ahlswede, Coloring hypergraphs: a new approach to multi-user source coding, part II. J. Combin. Inform. System Sci. 5(3), 220–268 (1980)

    MathSciNet  MATH  Google Scholar 

  4. R. Ahlswede, G. Dueck, Good codes can be produced by a few permutations. IEEE Trans. Inform. Theory 28(3), 430–443 (1982)

    Article  MathSciNet  Google Scholar 

  5. R. Ahlswede, G. Dueck, Identification via channels. IEEE Trans. Inform. Theory 35(1) (1989)

    Google Scholar 

  6. R. Ahlswede, G. Dueck, Identification in the presence of feedback – a discovery of new capacity formulas. IEEE Trans. Inform. Theory 35(1) (1989)

    Google Scholar 

  7. A. Alexander, I. Althöfer, C. Deppe, U. Tamm (eds.), Storing and Transmitting Data Rudolf Ahlswede’s Lectures on Information Theory 1, vol. 10, 1st edn. (Springer, Berlin, 2014). Series: Foundations in Signal Processing, Communications and Networking

    Google Scholar 

  8. A. Alexander, I. Althöfer, C. Deppe, U. Tamm (eds.), Combinatorial Methods and Models, Rudolf Ahlswede’s Lectures on Information Theory 4, vol. 13, 1st edn. (Springer, Berlin, 2018). Series: Foundations in Signal Processing, Communications and Networking

    Google Scholar 

  9. I. Csiszár, J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Channels (Academic Press, New York, 1981)

    MATH  Google Scholar 

  10. T.S. Han, S. Verdú, New results in the theory of identification via channels. IEEE Trans. Inform. Theory 38(1), 14–25 (1992)

    Article  MathSciNet  Google Scholar 

  11. T.S. Han, S. Verdú, Approximation theory of output statistics. IEEE Trans. Inform. Theory 39(3), 752–772 (1993)

    Article  MathSciNet  Google Scholar 

  12. J. Ja’Ja’, Identification is easier than decoding. Annu. Symp. Found. Comput. Sci. 26, 43–50 (1985)

    Google Scholar 

  13. U. Krengel, Einführung in die Wahrscheinlichkeitstheorie und Statistik, Vieweg (1991)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. J. Wolfowitz, Coding Theorems of Information Theory, 3rd ed. (Springer, New York, 1978)

    Book  Google Scholar 

  16. A.C. Yao, Some complexity questions related to distributive computing. Proceedings of the 11th Annual ACM Symposium on Theory of Computing, Atlanta, pp. 209–213 (1979)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Bielefeld, Germany

    Rudolf Ahlswede

Authors
  1. Rudolf Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Bielefeld, Germany

    Alexander Ahlswede

  2. Faculty Mathematics and Computer Science, Friedrich-Schiller-University Jena, Jena, Germany

    Ingo Althöfer

  3. Institute for Communications Engineering, Technical University of Munich, München, Germany

    Christian Deppe

  4. Fachbereich Wirtschaft und Gesundheit, Fachhochschule Bielefeld, Bielefeld, Germany

    Ulrich Tamm

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Ahlswede, R. (2021). Identification via Channels. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Identification and Other Probabilistic Models. Foundations in Signal Processing, Communications and Networking, vol 16. Springer, Cham. https://doi.org/10.1007/978-3-030-65072-8_1

Download citation

Publish with us

Policies and ethics

Search

Navigation