12 citations · 25 across the 37 of their papers we have counts for
14 papers · 1 filter
Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound
Soham Ghosh, Evagoras Stylianou, Holger Boche
We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any k…
Minimal Trellises for non-Degenerate and Degenerate Decoding of Quantum Stabilizer Codes
Evagoras Stylianou, Vladimir Sidorenko, Christian Deppe +1
This paper presents a comprehensive guide to designing minimal trellises for both non-degenerate and degenerate decoding of quantum stabilizer codes. For non-degenerate decoding, v…
Identification over Affine Poisson Channels: Application to Molecular Mixture Communication Systems
Mohammad Javad Salariseddigh, Heinz Koeppl, Holger Boche +1
Identification capacity has been established as a relevant performance metric for various goal-/task-oriented applications, where the receiver may be interested in only a particula…
Ning Cai: A Tribute to a Pioneering Scholar in Information Theory
Ingo Althöfer, Holger Boche, Christian Deppe +3
It is with heavy hearts that we mourn the passing of Ning Cai, a luminary whose pioneering spirit illuminated the realms of network coding and beyond. On May 25, 2023, at the age o…
Workshop on Information Theory and Related Fields -- In Memory of Ning Cai
Christian Deppe, Holger Boche, Rami Ezzine +1
Sadly, our esteemed colleague and friend Ning Cai passed away on 25th May, 2023. In his memory, Ingo Althöfer, Holger Boche, Christian Deppe, Jens Stoye, Ulrich Tamm, Andreas Winte…
An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels
Yaning Zhao, Wafa Labidi, Holger Boche +2
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…
Identification via Gaussian Multiple Access Channels in the Presence of Feedback
Yaning Zhao, Wafa Labidi, Holger Boche +2
We investigate message identification over a K-sender Gaussian multiple access channel (K-GMAC). Unlike conventional Shannon transmission codes, the size of randomized identificati…
Common Randomness Generation from Sources with Infinite Polish Alphabet
Wafa Labidi, Rami Ezzine, Moritz Wiese +2
We investigate the problem of common randomness (CR) generation in the basic two-party communication setting in which a sender and a receiver aim to agree on a common random variab…
Function Computation and Identification over Locally Homomorphic Multiple-Access Channels
Johannes Rosenberger, Holger Boche, Juan A. Cabrera +1
We develop the notion of a locally homomorphic channel and prove an approximate equivalence between those and codes for computing functions. Further, we derive decomposition proper…
Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement
Soham Ghosh, Vladlen Galetsky, Pol Juliá Farré +3
Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs, serving as secure fingerprints for cryptographic pro…
Deterministic Identification Codes for Fading Channels
Ilya Vorobyev, Christian Deppe, Holger Boche
Many communication applications incorporate event-triggered behavior, where the conventional Shannon capacity may not effectively gauge performance. Consequently, we advocate for t…
Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates
Pau Colomer, Christian Deppe, Holger Boche +1
Following initial work by JaJa, Ahlswede and Cai, and inspired by a recent renewed surge in interest in deterministic identification (DI) via noisy channels, we consider the proble…
Zero-entropy encoders and simultaneous decoders in identification via quantum channels
Pau Colomer, Christian Deppe, Holger Boche +1
Motivated by deterministic identification via classical channels, where the encoder is not allowed to use randomization, we revisit the problem of identification via quantum channe…
Common Randomness Generation from Finite Compound Sources
Rami Ezzine, Moritz Wiese, Christian Deppe +1
We investigate the problem of generating common randomness (CR) from finite compound sources aided by unidirectional communication over rate-limited perfect channels. The two commu…