H. Boche, A. Grigorescu, R.F. Schaefer and H.V. Poor
Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory
IEEE International Symposium on Information Theory
Recent Results Session
IEEE
2024

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties
IEEE Transactions on Information Theory
2024
Early Access
Jun

A. Grigorescu, H. Boche, R.F. Schafer
Robust PUF based Authentication
Lehrstuhl für Nachrichtentechnik, TU Dresden
2015

H. Boche, A. Grigorescu, R.F. Schafer, H.V. Poor
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
IEEE International Conference on Communications
ICC 2024
IEEE
2024

H. Boche, A. Grigorescu, R.F. Schafer, H.V. Poor
On the Solvability of Resource Allocation Problems for Wireless Systems on Digital Computers
IEEE International Conference on Communications
ICC 2024
IEEE
2024

A. Grigorescu
On the Computability of Channel Capacity
Princeton University
2024

A. Grigorescu, H. Boche, R.F. Schaefer, H.V. Poor
Capacity Region Continuity of the Compound Broadcast Channel with Confidential Messages
2014

A. Grigorescu, H. Boche, R.F. Schaefer, H.V. Poor
Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties
2022

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
2023

H. Boche, A. Grigorescu, R.F. Schaefer, H.V. Poor
Algorithmic Computability of the Capacity of Gaussian Channels with Colored Noise
2023