Wafa Labidi

Mrs. Wafa Labidi


Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 February 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
MWMoritz Wiese
Moritz Wiese
WLWafa Labidi
Wafa Labidi
Christian DeppeChristian Deppe
Christian Deppe
HBHolger Boche
Holger Boche
We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon Theory. The consideration of communication systems beyond Shannon’s approach is useful in order to increase the efficiency of information transmission for certain applications. We propose a coding scheme that first generates infinite common randomness between the sender and the receiver. If the channel has a positive message transmission feedback capacity, for given error thresholds and sufficiently large blocklength this common randomness is then used to construct arbitrarily large deterministic identification codes. In particular, the deterministic identification feedback capacity is infinite regardless of the scaling (exponential, doubly exponential, etc.) chosen for the capacity definition. Clearly, if randomized encoding is allowed in addition to the use of feedback, these results continue to hold.

26 March 2025
Verified
Book Chapter
Closed access
PDF file
LBLarissa Brüche
Larissa Brüche
MMMarcel A. Mross
Marcel A. Mross
YZYaning Zhao
Yaning Zhao
WLWafa Labidi
Wafa Labidi
Christian DeppeChristian Deppe
Christian Deppe
EJEduard A. Jorswieck
Eduard A. Jorswieck

27 December 2024 in Entropy
Verified
Journal Article
Open access
PDF file
WLWafa Labidi
Wafa Labidi
YZYaning Zhao
Yaning Zhao
Christian DeppeChristian Deppe
Christian Deppe
HBHolger Boche
Holger Boche
In the identification (ID) scheme proposed by Ahlswede and Dueck, the receiver’s goal is simply to verify whether a specific message of interest was sent. Unlike Shannon’s transmission codes, which aim for message decoding, ID codes for a discrete memoryless channel (DMC) are far more efficient; their size grows doubly exponentially with the blocklength when randomized encoding is used. This indicates that when the receiver’s objective does not require decoding, the ID paradigm is significantly more efficient than traditional Shannon transmission in terms of both energy consumption and hardware complexity. Further benefits of ID schemes can be realized by leveraging additional resources such as feedback. In this work, we address the problem of joint ID and channel state estimation over a DMC with independent and identically distributed (i.i.d.) state sequences. State estimation functions as the sensing mechanism of the model. Specifically, the sender transmits an ID message over the DMC while simultaneously estimating the channel state through strictly causal observations of the channel output. Importantly, the random channel state is unknown to both the sender and the receiver. For this system model, we present a complete characterization of the ID capacity–distortion function.

22 December 2025 in IEEE Transactions on Molecular, Biological, and Multi-Scale Communications
Verified
Journal Article
Closed access
WLWafa Labidi
Wafa Labidi
VGVida Gholamian
Vida Gholamian
YZYaning Zhao
Yaning Zhao
Christian DeppeChristian Deppe
Christian Deppe
HBHolger Boche
Holger Boche
Molecular Communication (MC) is an emerging field of research focused on understanding how cells in the human body communicate and exploring potential medical applications. In theoretical analysis, the goal is to investigate cellular communication mechanisms and develop nanomachine-assisted therapies to combat diseases. Since cells transmit information by releasing molecules at varying intensities, this process is commonly modeled using Poisson channels. In our study, we consider a discrete-time Poisson channel (DTPC). MC is often event-driven, making traditional Shannon communication an unsuitable performance metric. Instead, we adopt the identification framework introduced by Ahlswede and Dueck. In this approach, the receiver is only concerned with detecting whether a specific message of interest has been transmitted. Unlike Shannon transmission codes, the size of identification (ID) codes for a discrete memoryless channel (DMC) increases doubly exponentially with blocklength when using randomized encoding. This remarkable property makes the ID paradigm significantly more efficient than classical Shannon transmission in terms of energy consumption and hardware requirements. Another critical aspect of MC, influenced by the concept of the Internet of Bio-NanoThings, is security. In-body communication must be protected against potential eavesdroppers. To address this, we first analyze the DTPC for randomized identification (RI) and then extend our study to secure randomized identification (SRI). We derive capacity formulas for both RI and SRI, providing a comprehensive understanding of their performance and security implications.

20 August 2024 in arXiv
Verified
Preprint
Open access
PDF file
YZYaning Zhao
Yaning Zhao
WLWafa Labidi
Wafa Labidi
HBHolger Boche
Holger Boche
EJEduard Jorswieck
Eduard Jorswieck
Christian DeppeChristian Deppe
Christian Deppe
In contrast to Shannon transmission codes, the size of identification (ID) codes for discrete memoryless channels (DMCs) experiences doubly exponential growth with the block length when randomized encoding is used. Additional enhancements within the ID paradigm can be realized through supplementary resources such as quantum entanglement, common randomness (CR), and feedback. Joint transmission and sensing demonstrate significant benefits over separation-based methods. Inspired by the significant impact of feedback on the ID capacity, our work delves into the realm of joint ID and sensing (JIDAS) for state-dependent multiple access channels (SD-MACs) with noiseless strictly casual feedback. Here, the senders aim to convey ID messages to the receiver while simultaneously sensing the channel states. We establish a lower bound on the capacity-distortion region of the SD-MACs. An example shows that JIDAS outperforms the separation-based approach.

17 August 2024 in arXiv
Verified
Preprint
Open access
PDF file
YZYaning Zhao
Yaning Zhao
WLWafa Labidi
Wafa Labidi
HBHolger Boche
Holger Boche
EJEduard Jorswieck
Eduard Jorswieck
Christian DeppeChristian Deppe
Christian Deppe
We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identification (ID) codes experiences a doubly exponential growth in the code length. Improvements in the ID approach can be attained through additional resources such as quantum entanglement, common randomness (CR), and feedback. It has been demonstrated that an infinite capacity can be attained for a single-user Gaussian channel with noiseless feedback, irrespective of the chosen rate scaling. We establish the capacity region of both the K-sender Gaussian multiple access channel (K-GMAC) and the K-sender state-dependent Gaussian multiple access channel (K-SD-GMAC) when strictly causal noiseless feedback is available.