Skip to main content
Conference Proceedings

Classical-quantum arbitrarily varying wiretap channel

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7777 234-246
DOI: 10.1007/978-3-642-36899-8_10
5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2013.

Author supplied keywords

Cite

CITATION STYLE

APA

Blinovsky, V., & Cai, M. (2013). Classical-quantum arbitrarily varying wiretap channel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7777, pp. 234–246). Springer Verlag. https://doi.org/10.1007/978-3-642-36899-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free