36 citations · 269 across the 67 of their papers we have counts for
9 papers · 2 filters
Information-Theoretically Secret Reed-Muller Identification with Affine Designs
Mattia Spandri, Roberto Ferrara, Christian Deppe +2
We consider the problem of information-theoretic secrecy in identification schemes rather than transmission schemes. In identification, large identities are encoded into small chal…
Identification Capacity of the Discrete-Time Poisson Channel
Wafa Labidi, Christian Deppe, Holger Boche
Numerous applications in the field of molecular communications (MC) such as healthcare systems are often event-driven. The conventional Shannon capacity may not be the appropriate…
Capacity Bounds for Identification With Effective Secrecy
Johannes Rosenberger, Abdalla Ibrahim, Boulat A. Bash +3
An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and…
Deterministic Identification Over Multiple-Access Channels
Johannes Rosenberger, Abdalla Ibrahim, Christian Deppe +1
Deterministic identification over K-input multiple-access channels with average input cost constraints is considered. The capacity region for deterministic identification is determ…
A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We consider a standard two-source model for uniform common randomness (UCR) generation, in which Alice and Bob observe independent and identically distributed (i.i.d.) samples of a…
Deterministic K-Identification For Binary Symmetric Channel
Ons Dabbabi, Mohammad Javad Salariseddigh, Christian Deppe +1
Deterministic K-Identification (DKI) for the binary symmetric channel (BSC) is developed. A full characterization of the DKI capacity for such a channel, with and without the Hammi…
Joint Identification and Sensing for Discrete Memoryless Channels
Wafa Labidi, Yaning Zhao, Christian Deppe +1
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 transmis…
Deterministic Identification For MC Binomial Channel
Mohammad Javad Salariseddigh, Vahid Jamali, Holger Boche +2
The Binomial channel serves as a fundamental model for molecular communication (MC) systems employing molecule-counting receivers. Here, deterministic identification (DI) is addres…
Correcting one error in channels with feedback
Ilya Vorobyev, Alexey Lebedev, Vladimir Lebedev +1
We address the problem of correcting a single error in an arbitrary discrete memoryless channel with error-free instantaneous feedback. For the case of a one-time feedback, we prop…