Doubly-Exponential Identification via Channels: Code Constructions and Bounds
University of Siegen
Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales doubly-exponentially in the blocklength, unlike common transmission (or channel) codes whose size scales exponentially. It suffices to use binary constant-weight codes (CWCs) to achieve the ID capacity. By relating the parameters of a binary CWC to the minimum distance of a code and using higher-order correlation moments, two upper bounds on the binary CWC size are proposed. These bounds are shown to be upper bounds also on the identifier sizes for ID codes constructed by using binary CWCs. We propose two code constructions based on optical orthogonal codes, which are used in optical multiple access schemes, have constant-weight codewords, and satisfy cyclic cross-correlation and auto-correlation constraints. These constructions are modified and concatenated with outer Reed-Solomon codes to propose new binary CWCs optimal for ID. Improvements to the finite-parameter performance of both our and existing code constructions are shown by using outer codes with larger minimum distance vs. blocklength ratios. We also illustrate ID performance regimes for which our ID code constructions perform significantly better than existing constructions.
Onur Günlü received the B.Sc. degree (with high distinction) in Electrical and Electronics Engineering from Bilkent University, Turkey in 2011; M.Sc. (with high distinction) and Dr.-Ing. (Ph.D. equivalent) degrees in Communications Engineering both from the Technical University of Munich (TUM), Germany in October 2013 and November 2018, respectively. He was a Working Student in the Communication Systems division of Intel Mobile Communications (IMC), now Apple Inc., in Munich, Germany during November 2012 - March 2013. He worked as a Research and Teaching Assistant at TUM between February 2014 - May 2019. He was a Visiting Researcher, among my other 10 Research Stays at Top Universities and Companies, at the Information and Communication Theory (ICT) Lab of TU Eindhoven, The Netherlands during February 2018 - March 2018. He was a Research Associate and Dozent at TU Berlin, Germany between June 2019 - September 2020, and has been a Research Group Leader and Dozent at TU Berlin since October 2020. He has been a Brain City Berlin Ambassador since June 2020. Since 2021, he has been a research assistant at the Chair of Communications Engineering and Security at the University of Siegen. My research interests include information theoretic privacy and security, coding theory, statistical signal processing for biometrics and physical unclonable functions (PUFs), federated learning (FL) with differential privacy (DP) and information privacy guarantees, and doubly-exponential secure identification via channels. Among my publications is the recent book Key Agreement with Physical Unclonable Functions and Biometric Identifiers (Dr. Hut Verlag, 2019). He is currently an Associate Editor of the EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING and MDPI ENTROPY Journal, a Guest Editor of the IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY, and a Reviewer Board Member of the MDPI COMPUTERS and INFORMATION Journals.