Strong converse for identification via quantum channels

IEEE Transactions on Information Theory

Volumn 48, Issue 3, 2002, Pages 569-579

  Ahlswede, Rudolf ^a   Winter, Andreas ^b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Covering hypergraphs; Identification; Large deviations; Quantum channels

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; STATISTICS; THEOREM PROVING;

DISCRETE MEMORYLESS CHANNELS (DMC);

INFORMATION THEORY;

EID: 0036495139     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.985947     Document Type: Article

References (29)

1. Coloring hypergraphs: A new approach to multi-user source coding - I
2. On set coverings in Cartesian product spaces
3. On concepts of performance parameters for channels
4. Identification via channels
5. Lower bounds for the Helmholtz function
6. New results in the theory of identification via channels
7. Approximation theory of output statistics
8. Jensen's inequality for operators and Löwner's theorem
9. Bounds for the quantity of information transmitted by a quantum channel
10. Problems in the mathematical theory of quantum communication channels
11. The capacity of the quantum channel with general signal states
12. Convex trace functions and the Wigner-Yanase-Dyson conjecture
13. Über monotone matrixfunktionen
14. Strong converse to the quantum channel coding theorem
15. Hide and seek, data storage and entropy
16. Quantum coding
17. A mathematical theory of communication
18. Inequality with applications in statistical mechanics
19. Coding theorem and strong converse for quantum channels
20. Compression of quantum measurement operations
21. The coding of messages subject to chance errors