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

DOI10.1109/TIT.2006.871040MaRDI QIDQ3547004zbMATH OpenFDO

Authors 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)

Recommendations

• New directions in the theory of identification via channels
• Rényi resolvability and its applications to the wiretap channel
• Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder
• A general formula for channel capacity
• A general formula for the capacity of stationary nonanticipatory channels

Cited in

(7)

• On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
• Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels
• Semantic security for quantum wiretap channels
• Common Information, Noise Stability, and Their Extensions
• Rényi resolvability and its applications to the wiretap channel
• Position-based coding and convex splitting for private communication over quantum channels

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547004)