activity
20122026
most citedPerformance Analysis of Identification Codes

36 citations · 269 across the 67 of their papers we have counts for

collaborators
Showing 2020Show all

15 papers · 1 filter

cs.IT2020

Algorithms for -ary Error-Correcting Codes with Limited Magnitude and Feedback

Christian Deppe, Vladimir Lebedev

Berlekamp and Zigangirov completely determined the capacity error function for binary error correcting codes with noiseless feedback. It is still an unsolved problem if the upper b…

cs.IT2020★ 21 cited

Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a quantum broadcast channel with cooperation between the receivers is considered. The first form of cooperation addressed is classical conferencing, where Receiv…

eess.SP2020★ 2 cited

Secure Identification for Gaussian Channels and Identification for Multi-Antenna Gaussian Channels

Wafa Labidi, Christian Deppe, Holger Boche

New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. F…

eess.SP2020★ 1 cited

Optimal Signal Processing for Common Randomness Generation over MIMO Gaussian Channels with Applications in Identification

Rami Ezzine, Wafa Labidi, Christian Deppe +1

Common randomness (CR), as a resource, is not commonly exploited in existing practical communication systems. In the CR generation framework, both the sender and receiver aim to ge…

cs.IT2020

Deterministic Identification Over Fading Channels

Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche +1

Deterministic identification (DI) is addressed for Gaussian channels with fast and slow fading, where channel side information is available at the decoder. In particular, it is est…

cs.IT2020★ 1 cited

On Effective Convergence in Fekete's Lemma and Related Combinatorial Problems in Information Theory

Holger Boche, Yannik Böck, Christian Deppe

Fekete's lemma is a well known result from combinatorial mathematics that shows the existence of a limit value related to super- and subadditive sequences of real numbers. In this…

cs.IT2020

Computability of the Zero-Error Capacity of Noisy Channels

Holger Boche, Christian Deppe

Zero-error capacity plays an important role in a whole range of operational tasks, in addition to the fact that it is necessary for practical applications. Due to the importance of…

cs.IT2020

Deterministic Identification Over Channels With Power Constraints

Mohammad J. Salariseddigh, Uzi Pereg, Holger Boche +1

The identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic ide…

cs.IT2020

How to apply the rubber method for channels with feedback

Christian Deppe, Vladimir Lebedev, Georg Maringer

We give an overview of applications of the rubber method. The rubber method is a coding algorithm that was developed in 2005 by Ahlswede, Deppe and Lebedev for channels with feedba…

cs.IT2020★ 36 cited

Performance Analysis of Identification Codes

Sencer Derebeyoglu, Christian Deppe, Roberto Ferrara

In this paper we analyse the construction of identification codes. Identification codes are based on the question "Is the message I have just received the one I am interested in?",…

cs.IT2020

Coding with Noiseless Feedback over the Z-channel

Christian Deppe, Vladimir Lebedev, Georg Maringer +1

In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an ad…

cs.IT2020

Quantum Channel State Masking

Uzi Pereg, Christian Deppe, Holger Boche

Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the qu…

cs.IT2020

Computability of the Zero-Error capacity with Kolmogorov Oracle

Holger Boche, Christian Deppe

The zero-error capacity of a discrete classical channel was first defined by Shannon as the least upper bound of rates for which one transmits information with zero probability of…

cs.IT2020

Bounds for the capacity error function for unidirectional channels with noiseless feedback

Christian Deppe, Vladimir Lebedev, Georg Maringer

In digital systems such as fiber optical communications, the ratio between probability of errors of type and can be large. Practically, one can assume that only…

quant-ph2020★ 9 cited

Semantic Security for Quantum Wiretap Channels

Holger Boche, Minglai Cai, Christian Deppe +2

We consider the problem of semantic security via classical-quantum and quantum wiretap channels and use explicit constructions to transform a non-secure code into a semantically se…