Almost independence of random variables and capacity of a secrecy channel
From MaRDI portal
Publication:1389262
zbMath0901.94022MaRDI QIDQ1389262
Publication date: 8 July 1998
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (9)
Semantic security for quantum wiretap channels ⋮ Secrecy results for compound wiretap channels ⋮ On inequalities between mutual information and variation ⋮ Concise and tight security analysis of the Bennett–Brassard 1984 protocol with finite key lengths ⋮ Strong Secrecy for Multiple Access Channels ⋮ Distillation of secret-key from a class of compound memoryless quantum sources ⋮ Generalization of a Pinsker problem ⋮ Over-the-Air computation for distributed machine learning and consensus in large wireless networks ⋮ Mosaics of combinatorial designs for information-theoretic security
This page was built for publication: Almost independence of random variables and capacity of a secrecy channel
