23 citations · 23 across the 8 of their papers we have counts for
Showing 2025 · cs.ITShow all
2 papers · 2 filters
cs.IT2025
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…
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…