| On the placement delivery array design for centralized coded caching scheme Q Yan, M Cheng, X Tang, Q Chen IEEE Transactions on Information Theory 63 (9), 5821-5833, 2017 | 276 | 2017 |
| Placement delivery array design through strong edge coloring of bipartite graphs Q Yan, X Tang, Q Chen, M Cheng IEEE Communications Letters 22 (2), 236-239, 2017 | 130 | 2017 |
| Constructions of coded caching schemes with flexible memory size M Cheng, J Jiang, Q Yan, X Tang IEEE Transactions on Communications 67 (6), 4166-4176, 2019 | 69 | 2019 |
| A time-and energy-aware collision tree protocol for efficient large-scale RFID tag identification L Zhang, W Xiang, X Tang, Q Li, Q Yan IEEE Transactions on Industrial Informatics 14 (6), 2406-2417, 2017 | 56 | 2017 |
| Some variant of known coded caching schemes with good performance M Cheng, J Jiang, X Tang, Q Yan IEEE Transactions on Communications 68 (3), 1370-1377, 2019 | 46 | 2019 |
| Fundamental limits of caching for demand privacy against colluding users Q Yan, D Tuninetti IEEE Journal on Selected Areas in Information Theory 2 (1), 192-207, 2021 | 45 | 2021 |
| Storage, computation, and communication: A fundamental tradeoff in distributed computing Q Yan, S Yang, M Wigger 2018 IEEE Information Theory Workshop (ITW), 1-5, 2018 | 45 | 2018 |
| Placement delivery array design for coded caching scheme in D2D networks J Wang, M Cheng, Q Yan, X Tang IEEE Transactions on Communications 67 (5), 3388-3395, 2019 | 40 | 2019 |
| A fundamental storage-communication tradeoff for distributed computing with straggling nodes Q Yan, M Wigger, S Yang, X Tang IEEE Transactions on Communications 68 (12), 7311-7327, 2020 | 38 | 2020 |
| A new capacity-achieving private information retrieval scheme with (almost) optimal file length for coded servers J Zhu, Q Yan, C Qi, X Tang IEEE Transactions on Information Forensics and Security 15, 1248-1260, 2019 | 37 | 2019 |
| Coded caching schemes with low rate and subpacketizations M Cheng, Q Yan, X Tang, J Jiang arXiv preprint arXiv:1703.01548, 2017 | 32 | 2017 |
| Placement delivery array design for combination networks with edge caching Q Yan, M Wigger, S Yang 2018 IEEE International Symposium on Information Theory (ISIT), 1555-1559, 2018 | 23 | 2018 |
| Improved constructions for secure multi-party batch matrix multiplication J Zhu, Q Yan, X Tang IEEE Transactions on Communications 69 (11), 7673-7690, 2021 | 22 | 2021 |
| Placement delivery array and its applications Q Yan, X Tang, Q Chen 2018 IEEE Information Theory Workshop (ITW), 1-5, 2018 | 20 | 2018 |
| Decentralized coded caching scheme with heterogeneous file sizes L Zheng, Q Chen, Q Yan, X Tang IEEE Transactions on Vehicular Technology 69 (1), 818-827, 2019 | 18 | 2019 |
| Online coded caching with random access Q Yan, U Parampalli, X Tang, Q Chen IEEE Communications Letters 21 (3), 552-555, 2016 | 17 | 2016 |
| Key superposition simultaneously achieves security and privacy in cache-aided linear function retrieval Q Yan, D Tuninetti IEEE Transactions on Information Forensics and Security 16, 5250-5263, 2021 | 16 | 2021 |
| Storage-computation-communication tradeoff in distributed computing: Fundamental limits and complexity Q Yan, S Yang, M Wigger IEEE Transactions on Information Theory 68 (8), 5496-5512, 2022 | 15 | 2022 |
| Symmetric private polynomial computation from lagrange encoding J Zhu, Q Yan, X Tang, S Li IEEE Transactions on Information Theory 68 (4), 2704-2718, 2022 | 14 | 2022 |
| Adaptive gradient coding H Cao, Q Yan, X Tang, G Han IEEE/ACM Transactions on Networking 30 (2), 717-734, 2021 | 13 | 2021 |
Xiaohu TangSouthwest Jiaotong Universoty在 swjtu.edu.cn 的电子邮件经过验证
