I received the Bachelor's degree in 2019 and my Master's degree in 2021, both from Technical University of Munich (TUM). My focus in the Bachelor was mainly on High Frequency Engineering. Later, my interests shifted towards Information and Coding Theory. I wrote my Bachelor's thesis about Coding for DNA Storage at the Professorship for Coding and Cryptography (COD), and during the master I worked on Identification over Compound and Arbitrarily Varying Broadcast Channels at the Chair of Communications Engineering (LNT).
Since October 2021, I am a research assistant at the Chair of Communications Engineering. Currently, I am working on theory for communications systems beyond Shannon's approach in the project 6G-life by the German Federal Ministry of Education and Research.
- semantic/goal-oriented communication theory
- multi-user information theory
- interference, channel uncertainty and active jammers trying to inhibit communication
- quantum information theory
- Algorithms in Quantum Theory (SS 2022)
[identification] Typicality verifier in Deterministic Identification
identification, typical, sequences, information theory, encoder, decoder, verifier
Identification is a communication scheme that allows rate advantages over transmission, with the tradeoff that identities cannot be decoded (as messages do) but can only be verified.
More precicely, while in transmission the receiver tries to determine the message m encoded by the sender, in identification the receiver is interested in his own specific identity i and want to verify whether the sender encoded i or not, without any attempt at figuring out which i' was exactly encoded.
The rates achievable by identification are remarkably dependent on whether stochastic or only deterministic encoders are allowed.
Here, we consider only deterministic identification.
The seminal work that started identificaion with deterministic encoders can be found at
while identification with stochastic encoders was initiated in
Identification come with the possibility of rending feasible the use of typicality.
In transmission, random codes and typicality decoders are impractical due to the exponential cost of defining and running such encoders and decoders, as every conditionally typical set of each possible codeword must be checked.
However, since in identification we only want to verify a specific message, only a single conditionally typical set needs to be verified, opening the possibility or rending typicality a valid and efficient solution for the receiver.
The goal of the project is to study the complexity and capacity of such a typical verifier both analytically and numerically, in the case of q-ary alphabets.
Related works on deterministic identification can be found at
Knowledge of typical sequences and typical sets is recommended, but not required.
- Identification Over Quantum Broadcast Channels. 2022 IEEE International Symposium on Information Theory (ISIT), 2022 mehr… Volltext ( DOI )
- Identification Over Quantum Broadcast Channels. QMATH Masterclass on Entropy Inequalities in Quantum Information Science, 2022 mehr…
- Deterministic Identification and Multi-User Models. Munich Doctoral Seminar on Communications, 2022 mehr…
- Functional Compression with Side Information and Randomization. Munich Doctoral Seminar on Communications, 2022 mehr…
- Deterministic Identification and Multi-User Models. 6G-life Project Meeting WP 1.3 (Post-Shannon), 2022 mehr…
- Identification over Compound MIMO Broadcast Channels. ICC 2022 - IEEE International Conference on Communications, 2022, 781-786 mehr… Volltext ( DOI )
- Local Testability of Codes and Identification. Munich Doctoral Seminar on Communications, 2021 mehr…