Daming Cao

Orcid: 0000-0002-2468-8263

According to our database1, Daming Cao authored at least 24 papers between 2014 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Flatter Tokens are More Valuable for Speculative Draft Model Training.
CoRR, January, 2026

On Discrete Age of Information of Status Updating System With General Packet Arrival Processes.
CoRR, January, 2026

2025
Segmented RIS-assisted covert communication: Joint optimization of beamforming and phase configuration.
Phys. Commun., 2025

Timely Updating on Ber/Geo/1/2 Queue Modeled Status Updating System with Eavesdropper.
Entropy, 2025

Transmitting Status Updates on Infinite Capacity Systems with Eavesdropper: Freshness Advantage of Legitimate Receiver.
Entropy, 2025

Discrete Age Analysis of Ber/G/1/1 Queues: Exact Expressions and Optimization.
Proceedings of the IEEE Information Theory Workshop, 2025

2024
Discrete Age of Information for Bufferless System With Multiple Prioritized Sources.
IEEE Internet Things J., June, 2024

Enhancing Covert Communication in OOK Schemes by Phase Deflection.
IEEE Trans. Inf. Forensics Secur., 2024

2023
Covert Communication Gains From Adversary's Uncertainty of Phase Angles.
IEEE Trans. Inf. Forensics Secur., 2023

Capacity-Distortion Tradeoff of Noisy Gaussian State Amplification.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2021
Privacy-Utility Tradeoff for Hypothesis Testing Over a Noisy Channel.
IEEE Trans. Inf. Forensics Secur., 2021

2020
Hypothesis Testing with Privacy Constraints Over A Noisy Channel.
CoRR, 2020

Characterizing Linear Memory-Rate Tradeoff of Coded Caching: The $(N, K)=(3, 3)$ Case.
CoRR, 2020

Secret Key Generation From Vector Gaussian Sources With Public and Private Communications.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Coded Caching With Asymmetric Cache Sizes and Link Qualities: The Two-User Case.
IEEE Trans. Commun., 2019

A Strong Converse Theorem for Hypothesis Testing Against Independence over a Two-Hop Network.
Entropy, 2019

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
High-Agreement Uncorrelated Secret Key Generation Based on Principal Component Analysis Preprocessing.
IEEE Trans. Commun., 2018

Coded Caching with Heterogeneous Cache Sizes and Link Qualities: The Two-User Case.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Exact Error and Erasure Exponents for the Asymmetric Broadcast Channel.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Secret key generation from correlated sources and secure link.
Proceedings of the 9th International Conference on Wireless Communications and Signal Processing, 2017

2015
Deception With Side Information in Biometric Authentication Systems.
IEEE Trans. Inf. Theory, 2015

Message authentication with correlated sources.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Authentication with side information.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014


  Loading...