Approximate Secrecy Capacity of Gaussian Parallel Relay Networks

DOI10.1109/TIT.2015.2468216MaRDI QIDQ2977233zbMATH OpenOpenAlexFDO

Authors Nicolas Schrammar, Mikael Skoglund

Publication date 28 April 2017

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

Full work available at URL https://doi.org/10.1109/tit.2015.2468216

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited in

(5)

• The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents
• scientific article; zbMATH DE number 7234001 (Why is no real title available?)
• Algorithms for Secrecy Guarantee With Null Space Beamforming in Two-Way Relay Networks
• Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
• Secrecy Capacity Scaling in Large Cooperative Wireless Networks

This page was built for publication: Approximate Secrecy Capacity of Gaussian Parallel Relay Networks

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