Optimal frequency hopping sequences of odd length X Zeng, H Cai, X Tang, Y Yang IEEE Transactions on Information Theory 59 (5), 3237-3248, 2013 | 96 | 2013 |
On optimal locally repairable codes with super-linear length H Cai, Y Miao, M Schwartz, X Tang IEEE Transactions on Information Theory 66 (8), 4853-4868, 2020 | 66 | 2020 |
A class of optimal frequency hopping sequences with new parameters X Zeng, H Cai, X Tang, Y Yang IEEE transactions on information theory 58 (7), 4899-4907, 2012 | 52 | 2012 |
A New Construction of Frequency-Hopping Sequences with Optimal Partial Hamming Correlation H Cai, Z Zhou, Y Yang, X Tang IEEE transactions on information theory 60 (9), 5782 - 5790, 2014 | 43 | 2014 |
A construction of maximally recoverable codes with order-optimal field size H Cai, Y Miao, M Schwartz, X Tang IEEE Transactions on Information Theory 68 (1), 204-212, 2021 | 42 | 2021 |
A new construction of zero-difference balanced functions and its applications H Cai, X Zeng, T Helleseth, X Tang, Y Yang IEEE transactions on information theory 59 (8), 5008-5015, 2013 | 39 | 2013 |
Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes H Cai, Y Yang, Z Zhou, X Tang Information Theory, IEEE Transactions on 62 (2), 1087-1093, 2016 | 33 | 2016 |
On optimal locally repairable codes with multiple disjoint repair sets H Cai, Y Miao, M Schwartz, X Tang IEEE Transactions on Information Theory 66 (4), 2402-2416, 2019 | 26 | 2019 |
Zero-difference balanced functions with new parameters and their applications H Cai, Z Zhou, X Tang, Y Miao IEEE Transactions on Information Theory 63 (7), 4379-4387, 2017 | 22 | 2017 |
On optimal locally repairable codes and generalized sector-disk codes H Cai, M Schwartz IEEE Transactions on Information Theory 67 (2), 686-704, 2020 | 20 | 2020 |
Constructions of optimal 2-D optical orthogonal codes via generalized cyclotomic classes H Cai, H Liang, X Tang IEEE Transactions on Information Theory 61 (1), 688-695, 2014 | 20 | 2014 |
Optimal locally repairable systematic codes based on packings H Cai, M Cheng, C Fan, X Tang IEEE Transactions on Communications 67 (1), 39-49, 2018 | 15 | 2018 |
Optimal locally repairable codes: An improved bound and constructions H Cai, C Fan, Y Miao, M Schwartz, X Tang IEEE Transactions on Information Theory 68 (8), 5060-5074, 2022 | 9 | 2022 |
A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences C Fan, H Cai, X Tang IEEE Transactions on Information Theory 62 (8), 4769-4774, 2016 | 9 | 2016 |
Network-coding solutions for minimal combination networks and their sub-networks H Cai, J Chrisnata, T Etzion, M Schwartz, A Wachter-Zeh IEEE Transactions on Information Theory 66 (11), 6786-6798, 2020 | 8 | 2020 |
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization Y Liu, H Cai, X Tang IEEE Transactions on Information Theory 69 (5), 2820-2829, 2023 | 7 | 2023 |
Network coding solutions for the combination network and its subgraphs H Cai, T Etzion, M Schwartz, A Wachter-Zeh 2019 IEEE International Symposium on Information Theory (ISIT), 862-866, 2019 | 5 | 2019 |
A bound on the minimal field size of LRCs, and cyclic MR codes that attain it H Cai, M Schwartz IEEE Transactions on Information Theory 69 (4), 2240-2260, 2022 | 4 | 2022 |
Repairing schemes for tamo-barg codes H Cai, Y Miao, M Schwartz, X Tang 2024 IEEE International Symposium on Information Theory (ISIT), 2140-2145, 2024 | 2 | 2024 |
New optimal frequency hopping sequence sets from balanced nested difference packings of partition-type H Cai, X Zeng, X Tang, L Hu International Journal of Foundations of Computer Science 24 (04), 533-545, 2013 | 2 | 2013 |