Approximate Secrecy Capacity of Gaussian Parallel Relay Networks

DOI10.1109/TIT.2015.2468216zbMATH Open1359.94624OpenAlexW1505183654MaRDI QIDQ2977233

Mikael Skoglund, Nicolas Schrammar

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)

Related Items (5)

Secrecy Capacity Scaling in Large Cooperative Wireless Networks ⋮ Title not available (Why is that?) ⋮ Algorithms for Secrecy Guarantee With Null Space Beamforming in Two-Way Relay Networks ⋮ The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents ⋮ Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources

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)