Lin Zhou

IEEE Trans. Inf. Theory, September, 2023

Achievable Refined Asymptotics for Successive Refinement Using Gaussian Codebooks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, June, 2023

Efficient User Scheduling for Uplink Hybrid Satellite-Terrestrial Communication.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., March, 2023

Covert Communication for Spatially Sparse mmWave Massive MIMO Channels.

[BibT_eX]

[DOI]

Jinpeng Xu

IEEE Trans. Commun., March, 2023

Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources.

[BibT_eX]

[DOI]

Found. Trends Commun. Inf. Theory, 2023

From OTFS to DD-ISAC: Integrating Sensing and Communications in the Delay Doppler Domain.

[BibT_eX]

[DOI]

CoRR, 2023

On Finite Blocklength Lossy Source Coding.

[BibT_eX]

[DOI]

CoRR, 2023

Successive Refinement of Shannon Cipher System Under Maximal Leakage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Achievable Error Exponents for Almost Fixed-Length M-ary Classification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Achievable Error Exponents for Almost Fixed-Length M-Ary Hypothesis Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2023

2022

Second-Order Asymptotically Optimal Outlier Hypothesis Testing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets.

[BibT_eX]

[DOI]

Alfred Olivier Hero

IEEE Trans. Inf. Theory, 2022

Achievable Error Exponents for Almost Fixed-Length Hypothesis Testing and Classification.

[BibT_eX]

[DOI]

CoRR, 2022

Asymptotics for Outlier Hypothesis Testing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Excess-Distortion Exponents for Successive Refinement Using Gaussian Codebooks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Achievable Error Exponents for Almost Fixed-Length Binary Classification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

UAMP-Based Channel Estimation for OTFS in the Presence of the Fractional Doppler with HMM Prior.

[BibT_eX]

[DOI]

Zhongjie Li

Weijie Yuan

Proceedings of the IEEE/CIC International Conference on Communications in China, 2022

2021

Resolution Limits for the Noisy Non-Adaptive 20 Questions Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Privacy-Utility Tradeoff for Hypothesis Testing Over a Noisy Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2021

Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets.

[BibT_eX]

[DOI]

CoRR, 2021

Second-Order Asymptotically Optimal Outlying Sequence Detection with Reject Option.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Resolution Limits of Non-Adaptive 20 Questions Estimation for Multiple Targets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Achievable Resolution Limits for the Noisy Adaptive 20 Questions Problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Achievable Second-Order Asymptotics for Successive Refinement Using Gaussian Codebooks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Resolution Limits of 20 Questions Search Strategies for Moving Targets.

[BibT_eX]

[DOI]

Alfred Olivier Hero

Proceedings of the IEEE International Conference on Acoustics, 2021

2020

Distributed Detection With Empirically Observed Statistics.

[BibT_eX]

[DOI]

Haiyun He

IEEE Trans. Inf. Theory, 2020

Multiple Private Key Generation for Continuous Memoryless Sources With a Helper.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2020

Second-Order Asymptotically Optimal Universal Outlying Sequence Detection with Reject Option.

[BibT_eX]

[DOI]

CoRR, 2020

Hypothesis Testing with Privacy Constraints Over A Noisy Channel.

[BibT_eX]

[DOI]

CoRR, 2020

Resolution Limits of Non-Adaptive Querying for Noisy 20 Questions Estimation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

The Dispersion of Mismatched Joint Source-Channel Coding for Arbitrary Sources and Additive Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

On Lossy Multi-Connectivity: Finite Blocklength Performance and Second-Order Asymptotics.

[BibT_eX]

[DOI]

Albrecht Wolf

IEEE J. Sel. Areas Commun., 2019

Exponential Strong Converse for Successive Refinement with Causal Decoder Side Information.

[BibT_eX]

[DOI]

Entropy, 2019

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

[BibT_eX]

[DOI]

Entropy, 2019

Resolution Limits of Noisy 20 Questions Estimation.

[BibT_eX]

[DOI]

CoRR, 2019

Strong Converse for Hypothesis Testing Against Independence over a Two-Hop Network.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Second-Order Asymptotically Optimal Statistical Classification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Exponential Strong Converse for Content Identification With Lossy Recovery.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Second-Order Asymptotics of Universal JSCC for Arbitrary Sources and Additive Channels.

[BibT_eX]

[DOI]

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

Second-Order Asymptotics of Rate-Distortion using Gaussian Codebooks for Arbitrary Sources.

[BibT_eX]

[DOI]

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

On the Finite Blocklength Performance of Lossy Multi-Connectivity.

[BibT_eX]

[DOI]

Albrecht Wolf

Proceedings of the IEEE Global Communications Conference, 2018

2017

Second-Order and Moderate Deviations Asymptotics for Successive Refinement.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Discrete Lossy Gray-Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

The Dispersion of Universal Joint Source-Channel Coding for Arbitrary Sources and Additive Channels.

[BibT_eX]

[DOI]

CoRR, 2017

Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems.

[BibT_eX]

[DOI]

CoRR, 2017

Exponential Strong Converse for Content Identification with Lossy Recovery.

[BibT_eX]

[DOI]

CoRR, 2017

Achievable moderate deviations asymptotics for streaming Slepian-Wolf coding.

[BibT_eX]

[DOI]

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

Strong converse for content identification with lossy recovery.

[BibT_eX]

[DOI]

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

On the Multiple Description Coding Problem with One Semi-Deterministic Distortion Measure.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Kaspi Problem Revisited: Non-Asymptotic Converse Bound and Second-Order Asymptotics.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Global Communications Conference, 2017

2016

Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources.

[BibT_eX]

[DOI]

CoRR, 2016

Second-Order and Moderate Deviation Asymptotics for Successive Refinement.

[BibT_eX]

[DOI]

CoRR, 2016

Second-order coding region for the discrete successive refinement source coding problem.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Second-order coding region for the discrete lossy Gray-Wyner source coding problem.

[BibT_eX]

[DOI]