| Centralized coded caching schemes: A hypergraph theoretical approach C Shangguan, Y Zhang, G Ge IEEE Transactions on Information Theory 64 (8), 5755-5766, 2018 | 172 | 2018 |
| New constructions of MDS symbol-pair codes B Ding, G Ge, J Zhang, T Zhang, Y Zhang Designs, Codes and Cryptography 86 (4), 841-859, 2018 | 56 | 2018 |
| A general private information retrieval scheme for MDS coded databases with colluding servers Y Zhang, G Ge Designs, Codes and Cryptography 87 (11), 2611-2623, 2019 | 51 | 2019 |
| Private information retrieval from MDS coded databases with colluding servers under several variant models Y Zhang, G Ge arXiv preprint arXiv:1705.03186, 2017 | 41 | 2017 |
| On private information retrieval array codes Y Zhang, X Wang, H Wei, G Ge IEEE Transactions on Information Theory 65 (9), 5565-5573, 2019 | 37 | 2019 |
| New bounds of permutation codes under Hamming metric and Kendall’s -metric X Wang, Y Zhang, Y Yang, G Ge Designs, Codes and Cryptography 85 (3), 533-545, 2017 | 30 | 2017 |
| Snake-in-the-Box Codes for Rank Modulation Under Kendall’s -Metric Y Zhang, G Ge IEEE Transactions on Information Theory 62 (1), 151-158, 2016 | 27 | 2016 |
| Locally balanced constraints R Gabrys, HM Kiah, A Vardy, E Yaakobi, Y Zhang 2020 IEEE International Symposium on Information Theory (ISIT), 664-669, 2020 | 21 | 2020 |
| Bounds on the length of functional PIR and batch codes Y Zhang, T Etzion, E Yaakobi IEEE Transactions on Information Theory 66 (8), 4917-4934, 2020 | 20 | 2020 |
| On the access complexity of PIR schemes Y Zhang, E Yaakobi, T Etzion, M Schwartz 2019 IEEE International Symposium on Information Theory (ISIT), 2134-2138, 2019 | 14 | 2019 |
| Invertible binary matrices with maximum number of 2-by-2 invertible submatrices Y Zhang, T Zhang, X Wang, G Ge Discrete Mathematics 340 (2), 201-208, 2017 | 14 | 2017 |
| Improved constructions of permutation and multi-permutation codes correcting a burst of stable deletions Y Sun, Y Zhang, G Ge IEEE Transactions on Information Theory 69 (7), 4429-4441, 2023 | 13 | 2023 |
| Asymptotically Optimal Codes for (t, s)-Burst Error Y Sun, Z Lu, Y Zhang, G Ge IEEE Transactions on Information Theory, 2025 | 10 | 2025 |
| New lower bounds for secure codes and related hash families: A hypergraph theoretical approach Y Yang, Y Zhang, G Ge IEEE Transactions on Information Theory 63 (4), 2446-2453, 2017 | 9 | 2017 |
| Coding schemes for locally balanced constraints C Wang, Z Lu, Z Lan, G Ge, Y Zhang 2022 IEEE International Symposium on Information Theory (ISIT), 1342-1347, 2022 | 8 | 2022 |
| Improved constructions of secondary structure avoidance codes for DNA sequences H Chu, C Wang, Y Zhang 2023 12th international symposium on topics in coding (ISTC), 1-5, 2023 | 7 | 2023 |
| Snake-in-the-Box Codes for Rank Modulation under Kendall’s -Metric in Y Zhang, G Ge IEEE Transactions on Information Theory 62 (9), 4814-4818, 2016 | 7 | 2016 |
| Sequence reconstruction over 3-deletion channels D Zhang, G Ge, Y Zhang 2024 IEEE International Symposium on Information Theory (ISIT), 891-896, 2024 | 6 | 2024 |
| Spider-web enables stable, repairable, and encryptible algorithms under arbitrary local biochemical constraints in dna-based storage H Zhang, Z Lan, W Zhang, X Xu, Z Ping, Y Zhang, Y Shen arXiv preprint arXiv:2204.02855, 2022 | 6 | 2022 |
| t-Deletion-s-Insertion-Burst Correcting Codes Z Lu, Y Zhang IEEE Transactions on Information Theory 69 (10), 6401-6413, 2023 | 5 | 2023 |
Gennian GeCapital Normal UniversityVerified email at zju.edu.cn
