Asymptotic bound of secrecy capacity for MIMOME-based transceivers: a suboptimally tractable solution for imperfect CSI

DOI10.1155/2017/3656547zbMath1426.94069OpenAlexW2773815981MaRDI QIDQ1992649

Makan Zamanipour

Publication date: 5 November 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2017/3656547

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Expanded GDoF-optimality Regime of Treating Interference as Noise in the $M\times 2$ X-Channel
• Secure Degrees of Freedom of the Gaussian Diamond-Wiretap Channel
• Exact Random Coding Secrecy Exponents for the Wiretap Channel
• Outage Constrained Robust Transmit Optimization for Multiuser MISO Downlinks: Tractable Approximations by Conic Optimization
• Secrecy Rate Beamforming for Multicell Networks With Information and Energy Harvesting

This page was built for publication: Asymptotic bound of secrecy capacity for MIMOME-based transceivers: a suboptimally tractable solution for imperfect CSI