Qifa Yan

Zhengchun Zhou

IEEE Trans. Inf. Theory, November, 2024

An Efficient Coding Scheme for the AWGN Relay Network With Receiver-Transmitter Feedback.

[BibT_eX]

[DOI]

IEEE Syst. J., September, 2024

2023

A Fundamental Tradeoff Among Storage, Computation, and Communication for Distributed Computing Over Star Network.

[BibT_eX]

[DOI]

IEEE Trans. Commun., October, 2023

Robust, Private and Secure Cache-Aided Scalar Linear Function Retrieval from Blind Servers.

[BibT_eX]

[DOI]

Zhengchun Zhou

CoRR, 2023

Matrix Completion via Coded Distributed Alternating Least Squares.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Wireless Communications and Signal Processing, 2023

2022

Adaptive Gradient Coding.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2022

Symmetric Private Polynomial Computation From Lagrange Encoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Multi-User Blind Symmetric Private Information Retrieval From Coded Servers.

[BibT_eX]

[DOI]

Jinbao Zhu

IEEE J. Sel. Areas Commun., 2022

Robust, Private and Secure Cache-Aided Scalar Linear Function Retrieval From Coded Servers.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2022

2021

Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2021

Improved Constructions for Secure Multi-Party Batch Matrix Multiplication.

[BibT_eX]

[DOI]

Jinbao Zhu

IEEE Trans. Commun., 2021

Fundamental Limits of Caching for Demand Privacy Against Colluding Users.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Robust and Secure Cache-aided Private Linear Function Retrieval from Coded Servers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coded Alternating Least Squares for Straggler Mitigation in Distributed Recommendations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Secure and Server-User Private Linear Function Retrieval in Multi-Server Multi-User Systems.

[BibT_eX]

[DOI]

Proceedings of the ICC 2021, 2021

2020

Decentralized Coded Caching Scheme With Heterogeneous File Sizes.

[BibT_eX]

[DOI]

IEEE Trans. Veh. Technol., 2020

A New Capacity-Achieving Private Information Retrieval Scheme With (Almost) Optimal File Length for Coded Servers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Forensics Secur., 2020

A Fundamental Storage-Communication Tradeoff for Distributed Computing With Straggling Nodes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2020

Some Variant of Known Coded Caching Schemes With Good Performance.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2020

Symmetric Private Polynomial Computation From Lagrange Encoding.

[BibT_eX]

[DOI]

Jinbao Zhu

CoRR, 2020

Adaptive Gradient Coding.

[BibT_eX]

[DOI]

Hankun Cao

CoRR, 2020

2019

Placement Delivery Array Design for Coded Caching Scheme in D2D Networks.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Constructions of Coded Caching Schemes With Flexible Memory Size.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2019

Reducing Search Complexity of Coded Caching by Shrinking Search Space.

[BibT_eX]

[DOI]

Hankun Cao

IEEE Commun. Lett., 2019

Delivery Design for Coded Caching Over Wireless Multicast Networks.

[BibT_eX]

[DOI]

IEEE Access, 2019

2018

A Time- and Energy-Aware Collision Tree Protocol for Efficient Large-Scale RFID Tag Identification.

[BibT_eX]

[DOI]

IEEE Trans. Ind. Informatics, 2018

Placement Delivery Array Design Through Strong Edge Coloring of Bipartite Graphs.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

Storage, Computation, and Communication: A Fundamental Tradeoff in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Placement Delivery Array and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

A Storage-Computation-Communication Tradeoff for Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Wireless Communication Systems, 2018

Placement Delivery Array Design for Combination Networks with Edge Caching.

[BibT_eX]

[DOI]

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

2017

On the Placement Delivery Array Design for Centralized Coded Caching Scheme.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Online Coded Caching With Random Access.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2017

On the Placement and Delivery Schemes for Decentralized Coded Caching System.

[BibT_eX]

[DOI]

CoRR, 2017

Coded caching schemes for Flexible Memory Sizes.

[BibT_eX]

[DOI]

CoRR, 2017

Optimal Placement Delivery Arrays with Minimum Number of Rows.

[BibT_eX]

[DOI]

CoRR, 2017

2016

An Improved Algorithm for Testing the Membership of Gaussian Multiple-Access Channel Capacity Region.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2016

On the Coded Caching Delivery Design over Wireless Networks.

[BibT_eX]

[DOI]

CoRR, 2016

On the Gap Between Decentralized and Centralized Coded Caching Schemes.

[BibT_eX]

[DOI]

CoRR, 2016

Optimal Placement Delivery Arrays.

[BibT_eX]

[DOI]

CoRR, 2016

On the greedy coded caching scheme.

[BibT_eX]

[DOI]