An upper bound to the identification capacity of discrete memoryless wir...
Deterministic identification over K-input multiple-access channels with
...
In the identification (ID) scheme proposed by Ahlswede and Dueck, the
re...
We consider a standard two-source model for uniform common randomness (U...
Deterministic K-Identification (DKI) for the binary symmetric channel (B...
The Binomial channel serves as a fundamental model for molecular
communi...
Communication over a classical multiple-access channel (MAC) with
entang...
We address the problem of correcting a single error in an arbitrary disc...
Deterministic K-identification (DKI) is addressed for Gaussian channels
...
Several applications of molecular communications (MC) feature an alarm-p...
We consider the problem of remotely tracking the state of and unstable l...
We investigate the problem of message transmission and the problem of co...
We study a standard two-source model for common randomness (CR) generati...
Over the past decades, the problem of communication over finite-state Ma...
Ahlswede and Dueck showed possibility to identify with high probability ...
We generalize the uniform common randomness capacity formula, initially
...
Various applications of molecular communications (MC) are event-triggere...
In this paper, we developed new coding strategies for the Z-channel. In
...
We study the problem of common randomness (CR) generation in the basic
t...
Identification over quantum broadcast channels is considered. As opposed...
We investigate the problem of message transmission over time-varying
sin...
Entanglement resources can increase transmission rates substantially.
Un...
Communication over a quantum multiple-access channel (MAC) with cribbing...
The identification (ID) capacity region of the compound broadcast channe...
We describe a method of investigating the near-term potential of quantum...
Transmission of classical information over a quantum state-dependent cha...
Ahlswede and Dueck identification has the potential of exponentially red...
Identification is a communication paradigm that promises some exponentia...
Deterministic identification (DI) for the discrete-time Poisson channel,...
This article summarises the current status of classical communication
ne...
We investigate the problem of common randomness (CR) generation from dis...
We consider the task of remote state estimation and stabilization of
dis...
We analyze message identification via Gaussian channels with noiseless
f...
This paper analyzes the problem of common randomness (CR) generation fro...
The channel reliability function is an important tool that characterizes...
Communication over a quantum broadcast channel with cooperation between ...
Berlekamp and Zigangirov completely determined the capacity error functi...
Fekete's lemma is a well known combinatorial result pertaining to number...
Deterministic identification (DI) is addressed for Gaussian channels wit...
Zero-error capacity plays an important role in a whole range of operatio...
Identification capacity is developed without randomization at neither th...
We give an overview of applications of the rubber method. The rubber met...
In this paper we analyse the construction of identification codes.
Ident...
In this paper, we consider encoding strategies for the Z-channel with
no...
Communication over a quantum channel that depends on a quantum state is
...
The zero-error capacity of a discrete classical channel was first define...
In digital systems such as fiber optical communications the ratio betwee...
We determine the semantic security capacity for quantum wiretap channels...
We study the identification capacity of classical-quantum channels
("cq-...
We consider a model of communication via a fully quantum jammer channel ...