General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel

DOI10.1109/TIT.2006.871040zbMath1316.94047MaRDI QIDQ3547004

Masahito Hayashi

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Channel models (including quantum) in information and communication theory (94A40)

Related Items (5)

Semantic security for quantum wiretap channels ⋮ Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security ⋮ Position-based coding and convex splitting for private communication over quantum channels ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes ⋮ Common Information, Noise Stability, and Their Extensions

This page was built for publication: General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel