Optimal ternary constant-weight codes of weight four and distance six H Zhang, G Ge
IEEE transactions on information theory 56 (5), 2188-2203, 2010
31 2010 Grassmannian codes with new distance measures for network coding T Etzion, H Zhang
IEEE Transactions on Information Theory 65 (7), 4131-4142, 2019
22 2019 Optimal ternary constant-weight codes with weight 4 and distance 5 H Zhang, X Zhang, G Ge
IEEE transactions on information theory 58 (5), 2706-2718, 2012
17 2012 Constructions of optimal and near-optimal multiply constant-weight codes YM Chee, HM Kiah, H Zhang, X Zhang
IEEE Transactions on Information Theory 63 (6), 3621-3629, 2017
15 2017 Decompositions of edge-colored digraphs: A new technique in the construction of constant-weight codes and related families YM Chee, F Gao, HM Kiah, AC Hung Ling, H Zhang, X Zhang
SIAM Journal on Discrete Mathematics 33 (1), 209-229, 2019
13 2019 Optimal quaternary constant-weight codes with weight four and distance five H Zhang, G Ge
IEEE transactions on information theory 59 (3), 1617-1629, 2012
11 2012 Completely reducible super-simple designs with block size five and index two H Wei, H Zhang, G Ge
Designs, Codes and Cryptography 76, 589-600, 2015
9 2015 Hanani triple packings and optimal YM Chee, G Ge, H Zhang, X Zhang
Designs, Codes and Cryptography 75 (3), 387-403, 2015
9 2015 Completely reducible super-simple designs with block size four and related super-simple packings H Zhang, G Ge
Designs, Codes and Cryptography 58 (3), 321-346, 2011
9 2011 Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order YM Chee, X Zhang, H Zhang
arXiv preprint arXiv:1010.0280, 2010
8 2010 Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses YM Chee, CJ Colbourn, ACH Ling, H Zhang, X Zhang
Designs, Codes and Cryptography 77, 479-491, 2015
7 2015 Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four X Zhang, H Zhang, G Ge
Designs, Codes and Cryptography 62, 143-160, 2012
6 2012 Complexity of dependences in bounded domains, Armstrong codes, and generalizations YM Chee, H Zhang, X Zhang
IEEE Transactions on Information Theory 61 (2), 812-819, 2014
5 2014 Multiset combinatorial batch codes H Zhang, E Yaakobi, N Silberstein
Designs, Codes and Cryptography 86, 2645-2660, 2018
4 2018 Optimal ternary constant-composition codes with weight four and distance six H Wei, H Zhang, M Zhu, G Ge
Discrete Mathematics 338 (3), 72-87, 2015
4 2015 Lower bounds for total storage of multiset combinatorial batch codes using linear programming YM Chee, HM Kiah, H Zhang
IEEE Transactions on Information Theory 67 (1), 255-267, 2020
3 2020 Optimal codes in the Enomoto-Katona space YM Chee, HM Kiah, H Zhang, X Zhang
Combinatorics, Probability and Computing 24 (2), 382-406, 2015
3 2015 Regular multiset combinatorial batch codes over vector spaces YM Chee, DT Dao, T Etzion, HM Kiah, H Zhang
2021 IEEE International Symposium on Information Theory (ISIT), 3133-3138, 2021
2 2021 Recovery Sets of Subspaces from a Simplex Code YM Chee, T Etzion, HM Kiah, H Zhang
IEEE Transactions on Information Theory, 2024
2024 Recovery Sets of Subspaces from a Simplex Code Y Meng Chee, T Etzion, H Mao Kiah, H Zhang
arXiv e-prints, arXiv: 2403.20170, 2024
2024 
Yeow Meng CheeNational University of SingaporeПодтвержден адрес электронной почты в домене nus.edu.sg