Qifa YAN
Qifa YAN
Η διεύθυνση ηλεκτρονικού ταχυδρομείου έχει επαληθευτεί στον τομέα uic.edu
Τίτλος
Παρατίθεται από
Παρατίθεται από
Έτος
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
1342017
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
642017
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
312017
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
252019
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
242018
Coded caching schemes with low rate and subpacketizations
M Cheng, Q Yan, X Tang, J Jiang
arXiv preprint arXiv:1703.01548, 2017
242017
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
172019
Online coded caching with random access
Q Yan, U Parampalli, X Tang, Q Chen
IEEE Communications Letters 21 (3), 552-555, 2016
142016
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
132018
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
122019
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
122019
On the gap between decentralized and centralized coded caching schemes
Q Yan, X Tang, Q Chen
arXiv preprint arXiv:1605.04626, 2016
122016
A fundamental storage-communication tradeoff in distributed computing with straggling nodes
Q Yan, M Wigger, S Yang, X Tang
2019 IEEE International Symposium on Information Theory (ISIT), 2803-2807, 2019
92019
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
82021
Placement delivery array and its applications
Q Yan, X Tang, Q Chen
2018 IEEE Information Theory Workshop (ITW), 1-5, 2018
72018
On the coded caching delivery design over wireless networks
L Zheng, Q Yan, Q Chen, X Tang
arXiv preprint arXiv:1611.04853, 2016
62016
Key Superposition Simultaneously Achieves Security and Privacy in Cache-Aided Linear Function Retrieval
Q Yan, D Tuninetti
arXiv preprint arXiv:2009.06000, 2020
42020
On the placement and delivery schemes for decentralized coded caching system
Q Yan, X Tang, Q Chen
arXiv preprint arXiv:1710.04884, 2017
42017
The optimal placement delivery arrays
M Cheng, J Jiang, Q Yan, X Tang, H Cao
arXiv preprint arXiv:1611.04213, 2016
42016
On the coded caching based wireless video transmission scheme
L Zheng, Z Wang, Q Yan, Q Chen, X Tang
2016 IEEE/CIC International Conference on Communications in China (ICCC), 1-6, 2016
42016
Δεν είναι δυνατή η εκτέλεση της ενέργειας από το σύστημα αυτή τη στιγμή. Προσπαθήστε ξανά αργότερα.
Άρθρα 1–20