5 papers
Arithmetic Complexity of Solutions of the Dirichlet Problem
Holger Boche, Volker Pohl, H. Vincent Poor
The classical Dirichlet problem on the unit disk can be solved by different numerical approaches. The two most common and popular approaches are the integration of the associated P…
Confusions and Erasures of Error-Bounded Block Decoders with Finite Blocklength
Bin Han, Yao Zhu, Rafael F. Schaefer +4
This paper investigates two distinct types of block errors - undetected errors (confusions) and erasures - in additive white Gaussian noise (AWGN) channels with error-bounded block…
Time-Modulated Intelligent Reflecting Surfaces for Integrated Sensing, Communication and Security: A Generative AI Design Framework
Zhihao Tao, Athina Petropulu, H. Vincent Poor
We propose a novel approach to achieve physical layer security for integrated sensing and communication (ISAC) systems operating in the presence of targets that may be eavesdropper…
Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
Holger Boche, Volker Pohl, H. Vincent Poor
This paper studies the effective convergence of iterative methods for solving convex minimization problems using block Gauss--Seidel algorithms. It investigates whether it is alway…
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…