Hui Zhang
Orcid: 0000-0001-7816-0408Affiliations:
- National University of Singapore, Department of Industrial Systems Engineering and Management, Singapore
- Technion - Israel Institute of Technology, Computer Science Department, Haifa, Israel (2015 - 2017)
- Nanyang Technological University, School of Physical and Mathematical Sciences, Singapore (2012 - 2015)
- Zhejiang University, Department of Mathematics, Hangzhou, China (PhD 2013)
According to our database1,
Hui Zhang
authored at least 25 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing.
Des. Codes Cryptogr., December, 2023
2022
CoRR, 2022
2021
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming.
IEEE Trans. Inf. Theory, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
IEEE Trans. Inf. Theory, 2019
Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families.
SIAM J. Discret. Math., 2019
A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
2017
IEEE Trans. Inf. Theory, 2017
2015
IEEE Trans. Inf. Theory, 2015
Discret. Math., 2015
Des. Codes Cryptogr., 2015
Des. Codes Cryptogr., 2015
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.
Des. Codes Cryptogr., 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2013
IEEE Trans. Inf. Theory, 2013
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
IEEE Trans. Inf. Theory, 2012
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four.
Des. Codes Cryptogr., 2012
2011
Completely reducible super-simple designs with block size four and related super-simple packings.
Des. Codes Cryptogr., 2011
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order.
Adv. Math. Commun., 2011
2010
IEEE Trans. Inf. Theory, 2010