Characterization of the Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels

Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1

This paper studies the computability of the secrecy capacity of fast-fading wiretap channels from an algorithmic perspective, examining whether it can be computed algorithmically o…