Deterministic Identification: From Theoretical Analysis to Practical Identification Codes

Many communication applications are event-triggered, but current applications still use the Shannon communication model to transmit and decode messages. Due to the ever-growing number of users in communication networks, this leads to a weakening of performance. To counteract this, it makes sense to use post-Shannon methods such as deterministic identification (DI) codes. The information theory analysis carried out so far has shown how performance can be increased through DI codes. In this paper we provide a new constructive proof of the capacity of deterministic identification codes for discrete memoryless channels (DMC), while so far only existence proofs exist. Based on this idea, we implement DI codes of finite length and analyze their performance both analytically and experimentally. For the latter, we build a prototype using software-defined radios and a noise generator.