Follow
Han Cai
Han Cai
Verified email at my.swjtu.edu.cn
Title
Cited by
Cited by
Year
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
822013
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
472012
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
392014
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
362013
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
312020
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
312016
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
202021
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
182017
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
182014
On optimal locally repairable codes and generalized sector-disk codes
H Cai, M Schwartz
IEEE Transactions on Information Theory 67 (2), 686-704, 2020
112020
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
112019
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
102018
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
82016
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
42020
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
42019
Optimal locally repairable codes: An improved bound and constructions
H Cai, C Fan, Y Miao, M Schwartz, X Tang
IEEE Transactions on Information Theory, 2022
32022
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
22013
An improved bound for optimal locally repairable codes
H Cai, C Fan, Y Miao, M Schwartz, X Tang
2021 IEEE International Symposium on Information Theory (ISIT), 3379-3384, 2021
12021
Families of p-ary sequences with low correlation and large linear complexity
H Cai, X Zeng, L Hu
Journal of Systems Science and Complexity 27 (6), 1305-1319, 2014
12014
A Class of Minimum Storage Cooperative Regenerating Codes with Low Access Property
X Lin, H Cai, X Tang
arXiv preprint arXiv:2201.06236, 2022
2022
The system can't perform the operation now. Try again later.
Articles 1–20