Qiaoqiao Zhou

IEEE Trans. Inf. Theory, February, 2024

2023

Secret Key Agreement via Secure Omniscience.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, December, 2023

BAR: Blockwise Adaptive Recoding for Batched Network Coding.

[BibT_eX]

[DOI]

Entropy, July, 2023

Generalized Group Testing.

[BibT_eX]

[DOI]

Xiwei Cheng

Sidharth Jaggi

IEEE Trans. Inf. Theory, March, 2023

2022

Structural Entropy of the Stochastic Block Models.

[BibT_eX]

[DOI]

Entropy, 2022

Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

2021

Agglomerative Info-Clustering: Maximizing Normalized Total Correlation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

A Unified Adaptive Recoding Framework for Batched Network Coding.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Wiretap Secret Key Agreement Via Secure Omniscience.

[BibT_eX]

[DOI]

CoRR, 2021

Generalized Non-adaptive Group Testing.

[BibT_eX]

[DOI]

Xiwei Cheng

Sidharth Jaggi

CoRR, 2021

Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Secret Key Generation for Minimally Connected Hypergraphical Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On the Discussion Rate Region for the PIN Model.

[BibT_eX]

[DOI]

Raymond W. Yeung

Proceedings of the IEEE International Symposium on Information Theory, 2020

Secure Information Exchange for Omniscience.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Multiterminal Secret Key Agreement with Nearly No Discussion.

[BibT_eX]

[DOI]

Manuj Mukherjee

CoRR, 2019

One-Shot Perfect Secret Key Agreement for Finite Linear Sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Determining Optimal Rates for Communication for Omniscience.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

On the Optimality of Secret Key Agreement via Omniscience.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Change of Multivariate Mutual Information: From Local to Global.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources.

[BibT_eX]

[DOI]

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

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate.

[BibT_eX]

[DOI]

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

Agglomerative Info-Clustering.

[BibT_eX]

[DOI]

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

2017

On BATS Codes With Variable Batch Sizes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2017

Info-clustering: An efficient algorithm by network information flow.

[BibT_eX]

[DOI]

Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Secret key agreement under discussion rate constraints.

[BibT_eX]

[DOI]

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

2016

Info-Clustering: A Mathematical Theory for Data Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Mol. Biol. Multi Scale Commun., 2016

Successive Omniscience.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Robust rank-two beamforming for multicell multigroup multicast.

[BibT_eX]

[DOI]

Binyue Liu

Yong Cheng

IET Commun., 2016

Tree Analysis of BATS Codes.

[BibT_eX]

[DOI]

Shenghao Yang

IEEE Commun. Lett., 2016

Communication for Omniscience.

[BibT_eX]

[DOI]

CoRR, 2016

When is omniscience a rate-optimal strategy for achieving secret key capacity?

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Adaptive recoding for BATS codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Fairness in communication for omniscience.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Incremental and decremental secret key agreement.

[BibT_eX]

[DOI]