23 citations · 23 across the 8 of their papers we have counts for
5 papers · 1 filter
Continuously Ordered Hierarchies of Algorithmic Information in Digital Twinning and Signal Processing
Yannik N. Böck, Holger Boche, Frank H. P. Fitzek
We consider a fractional-calculus example of a continuous hierarchy of algorithmic information in the context of its potential applications in digital twinning. Digital twinning re…
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…
Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1
Since the work of Polyanskiy, Poor and Verdú on the finite blocklength performance of capacity-achieving codes for discrete memoryless channels, many papers have attempted to find…
Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels
Holger Boche, Andrea Grigorescu, Rafael F. Schaefer +1
This paper explores the computational complexity involved in determining the capacity of the band-limited additive colored Gaussian noise (ACGN) channel and its capacity-achieving…
Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions
Holger Boche, Rafael F. Schaefer, H. Vincent Poor
The capacity of a channel can usually be characterized as a maximization of certain entropic quantities. From a practical point of view it is of primary interest to not only comput…