SearchNote: This “quick search” only finds text in the shown fields,
not in abstracts or keywords. The search term must have at least
3 letters.
2025
- Algorithmic Characterization of the Outage Capacity of Gaussian Fading Channels. IEEE ICC 2025 (IEEE International Conference on Communications), IEEE, 2025 more…
- Arithmetic Complexity of the Secrecy Capacity of Fast-Fading Gaussian Channels. ISIT 2025 (IEEE International Symposium on Information Theory), IEEE, 2025 more…
- Code Design and Capacity Estimation for Fast-Fading Gaussian Channels: An Algorithmic Perspective. IEEE ICC 2025 (IEEE International Conference on Communications), IEEE, 2025 more…
2024
- On the Computability of Channel Capacity. Princeton University, 2024 more…
- Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties. IEEE Transactions on Information Theory 70 (8), 2024, 5413 - 5426 more… Full text ( DOI )
- On the Solvability of Resource Allocation Problems for Wireless Systems on Digital Computers. IEEE ICC 2024 (IEEE International Conference on Communications), IEEE, 2024 more…
- Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels. IEEE ICC 2024 (IEEE International Conference on Communications), IEEE, 2024 more…
- Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory. IEEE International Symposium on Information Theory, IEEE, 2024Recent Results Session more…
- Characterization of the Complexity of Computing the Capacity of Colored Gaussian Noise Channels. IEEE Transactions on Communications 72 (8), 2024, 4844 - 4856 more… Full text ( DOI )
- On the Non-Computability of Convex Optimization Problems. IEEE ISIT 2024 (IEEE International Symposium on Information Theory), IEEE, 2024 more…
- On the Solvability of Resource Allocation Problems for Wireless Systems on Digital Computers. IEEE ICC 2024 (IEEE International Conference on Communications), IEEE, 2024 more…
- Characterization of the Complexity of Computing the Capacity of Colored Noise Gaussian Channels. IEEE ICC 2024 (IEEE International Conference on Communications), IEEE, 2024 more…
2023
- Algorithmic Computability of the Capacity of Additive Colored Gaussian Noise Channels. 2023 IEEE Global Communications Conference, IEEE, 2023GLOBECOM 2023, 4375-4380 more… Full text ( DOI )
2022
- Information Theoretic Security and Privacy on the Basis of Physically Unclonable Functions. Kick-off Meeting "Grand Challenge der Quantenkommunikation", 2022 more…
- Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties. IEEE International Symposium on Information Theory, Aalto University, 2022ISIT 2022 more…
2019
- Differential Power Analysis Attacks from an Information-Theoretic Perspective. IEEE Information Theory Workshop , IEEE, 2019 more… Full text ( DOI )
2017
- Robust Biometric Authentication from an Information Theoretic Perspective. Entropy 19 (9), 2017, 480 more… Full text ( DOI )
- Compound Biometric Authentication Systems with Strong Secrecy. 11th International ITG Conference on Systems, Communications and Coding, ITG im VDE, 2017 more…
2016
- Broadcast Channels with Confidential Messages: Channel Uncertainty, Robustness, and Continuity. In: Physical and Data-Link Security Techniques for Future Communication Systems. Springer, 2016, 69-93 more…
2015
- Robust PUF based authentication. 2015 IEEE International Workshop on Information Forensics and Security (WIFS), 2015 more…
- Capacity region continuity of the compound broadcast channel with confidential messages. IEEE Information Theory Workshop (ITW), 2015 more… Full text (mediaTUM)
- Robust PUF based Authentication. Lehrstuhl für Nachrichtentechnik, TU Dresden, 2015 more…
2014
- Capacity Region Continuity of the Compound Broadcast Channel with Confidential Messages. arXiv, CoRR/Cornell University, 2014, more…