Christian Deppe

Ons Dabbabi

Future Internet, March, 2024

Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, January, 2024

Deterministic K-Identification for MC Poisson Channel With Inter-Symbol Interference.

[BibT_eX]

[DOI]

IEEE Open J. Commun. Soc., 2024

Minimal Trellises for non-Degenerate and Degenerate Decoding of Quantum Stabilizer Codes.

[BibT_eX]

[DOI]

CoRR, 2024

Ning Cai: A Tribute to a Pioneering Scholar in Information Theory.

[BibT_eX]

[DOI]

CoRR, 2024

An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels.

[BibT_eX]

[DOI]

CoRR, 2024

Identification via Gaussian Multiple Access Channels in the Presence of Feedback.

[BibT_eX]

[DOI]

CoRR, 2024

Second 6G life Workshop on Post Shannon Theory.

[BibT_eX]

[DOI]

Yaning Zhao

CoRR, 2024

Workshop on Information Theory and Related Fields - In Memory of Ning Cai.

[BibT_eX]

[DOI]

CoRR, 2024

Converse Techniques for Identification via Channels.

[BibT_eX]

[DOI]

CoRR, 2024

Common Randomness Generation from Sources with Infinite Polish Alphabet.

[BibT_eX]

[DOI]

CoRR, 2024

Function Computation and Identification over Locally Homomorphic Multiple-Access Channels.

[BibT_eX]

[DOI]

CoRR, 2024

Deterministic Identification Codes for Fading Channels.

[BibT_eX]

[DOI]

Ilya Vorobyev

CoRR, 2024

Deterministic Identification: From Theoretical Analysis to Practical Identification Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Information Theoretic Analysis of a Quantum PUF.

[BibT_eX]

[DOI]

Kumar Nilesh

Proceedings of the IEEE International Symposium on Information Theory, 2024

Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Common Randomness Generation from Finite Compound Sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Deterministic Identification Over Channels with Finite Output: A Dimensional Perspective on Superlinear Rates.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

Zero-Entropy Encoders and Simultaneous Decoders in Identification via Quantum Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2024

2023

Deterministic Identification for Molecular Communications Over the Poisson Channel.

[BibT_eX]

[DOI]

IEEE Trans. Mol. Biol. Multi Scale Commun., December, 2023

Message Identification for Task-Oriented Communications: Exploiting an Exponential Increase in the Number of Connected Devices.

[BibT_eX]

[DOI]

IEEE Internet Things Mag., December, 2023

Identification Over Additive Noise Channels in the Presence of Feedback.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, November, 2023

A Proof of a Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, November, 2023

Identification over quantum broadcast channels.

[BibT_eX]

[DOI]

Johannes Rosenberger

Quantum Inf. Process., October, 2023

Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour Clustering.

[BibT_eX]

[DOI]

Alonso Viladomat Jasso

Entropy, September, 2023

Identification Over Compound Multiple-Input Multiple-Output Broadcast Channels.

[BibT_eX]

[DOI]

Johannes Rosenberger

IEEE Trans. Inf. Theory, July, 2023

Communication With Unreliable Entanglement Assistance.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

On the Semidecidability of the Remote State Estimation Problem.

[BibT_eX]

[DOI]

Yannik N. Böck

IEEE Trans. Autom. Control., March, 2023

Information-theoretical analysis of event-triggered molecular communication.

[BibT_eX]

[DOI]

CoRR, 2023

Information-Theoretically Secret Reed-Muller Identification with Affine Designs.

[BibT_eX]

[DOI]

CoRR, 2023

Correcting one error in channels with feedback.

[BibT_eX]

[DOI]

CoRR, 2023

Deterministic K-Identification For Slow Fading Channels.

[BibT_eX]

[DOI]

Muris Spahovic

Proceedings of the IEEE Information Theory Workshop, 2023

Deterministic Identification for MC Binomial Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Deterministic Identification Over Multiple-Access Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Capacity Bounds for Identification With Effective Secrecy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Joint Identification and Sensing for Discrete Memoryless Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Deterministic Identification for MC ISI-Poisson Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2023

Common Randomness Generation from Sources with Countable Alphabet.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2023

The Multiple- Access Channel with Entangled and Conferencing Transmitters.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom Workshops 2023, 2023

The Multiple-Access Channel with Entangled Transmitters.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2023

Testing of Hybrid Quantum-Classical K-Means for Nonlinear Noise Mitigation.

[BibT_eX]

[DOI]

Ark Modi

Alonso Viladomat Jasso

Proceedings of the IEEE Global Communications Conference, 2023

Deterministic K-Identification for Binary Symmetric Channel.

[BibT_eX]

[DOI]

Ons Dabbabi

Proceedings of the IEEE Global Communications Conference, 2023

Quantum Satellite Communications.

[BibT_eX]

[DOI]

Proceedings of the A Roadmap to Future Space Connectivity, 2023

2022

Deterministic Identification Over Channels With Power Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

The Quantum Multiple-Access Channel With Cribbing Encoders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Coding With Noiseless Feedback Over the Z-Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Correcting a Single Error in Feedback Channels.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2022

Deterministic $K$-identification For Slow Fading Channel.

[BibT_eX]

[DOI]

Muris Spahovic

CoRR, 2022

Neuromorphic Twins for Networked Control and Decision-Making.

[BibT_eX]

[DOI]

CoRR, 2022

A Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels.

[BibT_eX]

[DOI]

CoRR, 2022

Identification based on random coding.

[BibT_eX]

[DOI]

Vladimir R. Sidorenko

CoRR, 2022

Non-adaptive and two-stage coding over the Z-channel.

[BibT_eX]

[DOI]

CoRR, 2022

A General Formula for Uniform Common Randomness Capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

The Quantum MAC with Cribbing Encoders.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Common Randomness Generation from Gaussian Sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Computability of the Channel Reliability Function and Related Bounds<sup>1</sup>.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Identification over Compound MIMO Broadcast Channels.

[BibT_eX]

[DOI]

Johannes Rosenberger

Proceedings of the IEEE International Conference on Communications, 2022

Deciding the Problem of Remote State Estimation via Noisy Communication Channels on Real Number Signal Processing Hardware.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2022

Comparison of Quantum PUF models.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021

Quantum Channel State Masking.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

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

[BibT_eX]

[DOI]

Georg Maringer

Theor. Comput. Sci., 2021

Integrating Quantum Simulation for Quantum-Enhanced Classical Network Emulation.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2021

Algorithms for q-ary error-correcting codes with limited magnitude and feedback.

[BibT_eX]

[DOI]

Discret. Math., 2021

Classical State Masking over a Quantum Channel.

[BibT_eX]

[DOI]

CoRR, 2021

Reed-Muller Identification.

[BibT_eX]

[DOI]

Mattia Spandri

Roberto Ferrara

CoRR, 2021

Practical implementation of identification codes.

[BibT_eX]

[DOI]

CoRR, 2021

Computability of the Channel Reliability Function and Related Bounds.

[BibT_eX]

[DOI]

CoRR, 2021

The Computational and Latency Advantage of Quantum Communication Networks.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 2021

Identification for Multi-Antenna Gaussian Channels.

[BibT_eX]

[DOI]

Proceedings of the 25th International ITG Workshop on Smart Antennas, 2021

Identification under Effective Secrecy.

[BibT_eX]

[DOI]

Abdalla Ibrahim

Roberto Ferrara

Proceedings of the IEEE Information Theory Workshop, 2021

Outage Common Randomness Capacity Characterization of Multiple-Antenna Slow Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Computability of the Zero-Error Capacity of Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

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

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Non-Adaptive and Adaptive Two-Sided Search with Fast Objects.

[BibT_eX]

[DOI]

Alexey V. Lebedev

Proceedings of the IEEE International Symposium on Information Theory, 2021

Identification over the Gaussian Channel in the Presence of Feedback.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Common Randomness Generation over Slow Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Deterministic Identification Over Poisson Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

On the Semi-Decidability of Remote State Estimation and Stabilization via Noisy Communication Channels.

[BibT_eX]

[DOI]

Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021

Quantum Communication Networks, 1

[BibT_eX]

[DOI]

23, Springer, ISBN: 978-3-030-62937-3, 2021

2020

Performance Analysis of Identification Codes.

[BibT_eX]

[DOI]

Sencer Derebeyoglu

Roberto Ferrara

Entropy, 2020

On the Effectiveness of Fekete's Lemma.

[BibT_eX]

[DOI]

CoRR, 2020

Deterministic Identification Over Fading Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

On the Effectiveness of Fekete's Lemma in Information Theory.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Computability of the Zero-Error Capacity with Kolmogorov Oracle.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Semantic Security for Quantum Wiretap Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Secure Identification for Gaussian Channels.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Common Randomness Generation and Identification over Gaussian Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2020

How to apply the rubber method for channels with feedback.

[BibT_eX]

[DOI]

Georg Maringer

Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019

Secure and Robust Identification via Classical-Quantum Channels.

[BibT_eX]

[DOI]

Andreas J. Winter

IEEE Trans. Inf. Theory, 2019

Secure Identification Under Passive Eavesdroppers and Active Jamming Attacks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2019

Secure Storage for Identification; Random Resources and Privacy Leakage.

[BibT_eX]

[DOI]

Sebastian Baur

IEEE Trans. Inf. Forensics Secur., 2019

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

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Secure Identification for Wiretap Channels; Robustness, Super-Additivity and Continuity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2018

A Combinatorial Model of Two-Sided Search.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Secure Storage for Identification.

[BibT_eX]

[DOI]

Sebastian Baur

Proceedings of the 19th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2018

Secret Message Transmission over Quantum Channels under Adversarial Quantum Noise: Secrecy Capacity and Super-activations.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Fully Quantum Arbitrarily Varying Channels: Random Coding Capacity and Capacity Dichotomy.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2017

Secret Message Transmission over Quantum Channels under Adversarial Quantum Noise: Secrecy Capacity and Super-Activation.

[BibT_eX]

[DOI]

CoRR, 2017

Secure identification under jamming attacks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Workshop on Information Forensics and Security, 2017

Robust and secure identification.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Classical-quantum arbitrarily varying wiretap channel: Secret message transmission under jamming attacks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Classical-quantum arbitrarily varying wiretap channel: Ahlswede dichotomy, positivity, resources, super-activation.

[BibT_eX]

[DOI]

Quantum Inf. Process., 2016

2015

The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel.

[BibT_eX]

[DOI]

Minglai Cai

Quantum Inf. Process., 2015

2014

Classical-quantum arbitrarily varying wiretap channel - A capacity formula with Ahlswede Dichotomy - Resources.

[BibT_eX]

[DOI]

Minglai Cai

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Group testing problem with two defectives.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2013

Secrecy capacities of compound quantum wiretap channels and applications

[BibT_eX]

[DOI]

CoRR, 2013

Superimposed Codes and Threshold Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

A Heuristic Solution of a Cutting Problem Using Hypergraphs.

[BibT_eX]

[DOI]

Christian Wischmann

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

Threshold and Majority Group Testing.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

Finding one of <i>D</i> defective elements in some group testing models.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2012

Capacities of classical compound quantum wiretap and classical quantum compound wiretap channels.

[BibT_eX]

[DOI]

Minglai Cai

Ning Cai

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Majority group testing with density tests.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Bounds for threshold and majority group testing.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2009

Two Batch Search With Lie Cost.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

2008

Searching with lies under error cost constraints.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

T-shift synchronization codes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2006

On q-ary fix-free codes and directed deBrujin graphs.

[BibT_eX]

[DOI]

Holger Schnettler

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Non-binary error correcting codes with noiseless feedback, localized errors, or both.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Q-ary Ulam-Rényi game with constrained lies.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Searching with lies under error transition cost constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A Fast Suffix-Sorting Algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Information theoretic models in language evolution.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

Strategies for the Renyi-Ulam Game with fixed number of lies.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Language evolution and information theory.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Q-Ary Ulam-Rényi Game with Weighted Constrained Lies.

[BibT_eX]

[DOI]

Daniele Mundici

Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003

Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2001

An Isoperimetric Theorem for Sequences Generated by Feedback and Feedback-Codes for Unequal Error Protection.

[BibT_eX]

[DOI]

Ning Cai

Probl. Inf. Transm., 2001

2000

Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes.

[BibT_eX]

[DOI]