Showing cs.ITShow all
2 papers · 1 filter
cs.IT2025
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…
cs.IT2022
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties
Andrea Grigorescu, Holger Boche, Rafael F. Schaefer +1
The capacity of finite state channels (FSCs) with feedback has been shown to be a limit of a sequence of multi-letter expressions. Despite many efforts, a closed-form single-letter…