1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
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…
A Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels
Rami Ezzine, Moritz Wiese, Christian Deppe +1
Over the past decades, the problem of communication over finite-state Markov channels (FSMCs) has been investigated in many researches and the capacity of FSMCs has been studied in…
A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We investigate the problem of message transmission over time-varying single-user multiple-input multiple-output (MIMO) Rayleigh fading channels with average power constraint and wi…
The Compound Multiple Access Channel with Partially Cooperating Encoders
Moritz Wiese, Holger Boche, Igor Bjelaković +1
The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-acces…