Skip to main content

Classical-Quantum Arbitrarily Varying Wiretap Channel

  • Chapter
Information Theory, Combinatorics, and Search Theory

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

Abstract

We derive a lower bound on the secrecy capacity of classical-quantum arbitrarily varying wiretap channel for both the case with and without channel state information at the transmitter.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Ahlswede, R., Blinovsky, V.: Classical capacity of classical-quantum arbitrarily varying channels. IEEE Trans. Inform. Theory 53(2), 526–533 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bjelaković, I., Boche, H., Janßen, G., Nötzel, J.: Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities, arXiv:1209.6325 (2012)

    Google Scholar 

  3. Bjelaković, I., Boche, H., Sommerfeld, J.: Capacity results for arbitrarily varying wiretap channels, arXiv:1209.5213 (2012)

    Google Scholar 

  4. Cai, M., Cai, N., Deppe, C.: Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels, arXiv:1202.0773v1 (2012)

    Google Scholar 

  5. Cai, N., Winter, A., Yeung, R.W.: Quantum privacy and quantum wiretap channels. Problems of Information Transmission 40(4), 318–336 (2004)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Devetak, I.: The private classical information capacity and quantum information capacity of a quantum channel. IEEE Trans. Inf. Theory 51(1), 44–55 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. Blackwell, D., Breiman, L., Thomasian, A.J.: The capacities of a certain channel classes under random coding. Ann. Math. Statist. 31(3), 558–567 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  9. Holevo, S.: Statistical problems in quantum physics. In: Maruyama, G., Prokhorov, J.V. (eds.) Proceedings of the Second Japan-USSR Symposium on Probability Theory. Lecture Notes in Mathematics, vol. 330, pp. 104–119. Springer, Berlin (1973)

    Chapter  Google Scholar 

  10. Wilde, M.: From Classical to Quantum Shannon Theory, arXiv:1106-1445 (2011)

    Google Scholar 

  11. Winter, A.: Coding theorem and strong converse for quantum channels. IEEE Trans. Inf. Theory 45(7), 2481–2485 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wyner, A.D.: The wiretap channel. Bell System Technical Journal 54(8), 1355–1387 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Blinovsky, V., Cai, M. (2013). Classical-Quantum Arbitrarily Varying Wiretap Channel. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36899-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36898-1

  • Online ISBN: 978-3-642-36899-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics