I am Professor and Chair of the School of Physical and Mathematical Sciences at the Nanyang Technological University, Singapore.

I am also concurrently the co-director of the Data Science and Artificial Intelligence Research Centre at the Nanyang Technological University.

My research focuses on the interface between combinatorics and information theory

Designs, Codes and Cryptography

Triple systems, block designs, pairwise balanced designs, group divisible designs, t-designs, latin squares, error-correcting codes, erasure-resilient codes, codes for unconventional channels, combinatorial cryptography, algorithms and computational methods.

Extremal Set Theory

Turán-type problems, packings and coverings, cover-free systems, nonadaptive group testing.

Electronic Design Automation

Low-power design, thermal-aware design, crosstalk issues, testing of deep submicron and nanometer-scale circuits.


Publications

Journal Papers

  1. Y. M. Chee and X. Zhang, "Linear size constant-composition codes meeting the Johnson bound," IEEE Transactions on Information Theory, to appear (accepted March 2017).
  2. Y. M. Chee, H. M. Kiah, H. Zhang, and X. Zhang, "Constructions of optimal and near-optimal multiply constant-weight codes," IEEE Transactions on Information Theory, to appear (accepted November 2016).
  3. Y. M. Chee, H. M. Kiah, P. Purkayastha, and P. Solé, "Product construction of affine codes," SIAM Journal on Discrete Mathematics, vol. 29, no. 3, pp. 1540–1552, 2015. [PDF]
  4. Y. M. Chee, C. J. Colbourn, A. C. H. Ling, H. Zhang, and X. Zhang, "Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses," Designs, Codes and Cryptography, vol. 77, no. 2, pp. 479–491, 2015. [PDF]
  5. Y. M. Chee, G. Ge, H. Zhang, and X. Zhang, "Hanani triple packings and optimal q-ary codes of constant weight three," Designs, Codes and Cryptography, vol. 75, no. 3, pp. 387–403, 2015. [PDF]
  6. Y. M. Chee, H. M. Kiah, A. C. H. Ling, and C. Wang, "Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications," Journal of Combinatorial Designs, vol. 23, no. 4, pp. 151–182, 2015. [PDF]
  7. Y. M. Chee, H. M. Kiah, H. Zhang, and X. Zhang, "Optimal codes in the Enomoto-Katona space," Combinatorics, Probability and Computing, vol. 24, no. 2, pp. 382–406, 2015. [PDF]
  8. Y. M. Chee, H. Zhang, and X. Zhang, "Complexity of dependencies in bounded domains, Armstrong codes, and generalizations," IEEE Transactions on Information Theory, vol. 61, no. 2, pp. 812–819, 2015. [PDF]
  9. S. H. Dau and Y. M. Chee, “Polynomial time algorithm for min-ranks of graphs with simple tree structures,” Algorithmica, vol. 71, no. 1, pp. 152–180, 2015. [PDF]
  10. Y. M. Chee, Z. Cherif, J.-L. Danger, S. Guilley, H. M. Kiah, J.-L. Kim, P. Solé, and X. Zhang, "Multiply constant-weight codes and the reliability of loop physically unclonable functions," IEEE Transactions on Information Theory, vol. 60, no. 11, pp. 7026–7034, 2014. [PDF]
  11. B. Liu, G. Cong, Y. Zeng, D. Xu, and Y. M. Chee, "Influence spreading path and its application to the time constrained social influence maximization problem and beyond," IEEE Transactions on Knowledge and Data Engineering, vol. 26, no. 8, pp. 1904–1917, 2014. [PDF]
  12. C. Caliskan and Y. M. Chee, "New infinite families of 2-edge-balanced graphs," Journal of Combinatorial Designs, vol. 22, no. 7, pp. 291–305, 2014. [PDF]
  13. S. H. Dau, V. Skachek, and Y. M. Chee, "Optimal index codes with near-extreme rates," IEEE Transactions on Information Theory, vol. 60, no. 3, pp. 1515–1527, 2014. [PDF]
  14. Y. M. Chee, L. Ji, H. M. Kiah, C. Wang, and J. Yin, "Maximum distance separable codes for symbol-pair read channels," IEEE Transactions on Information Theory, vol. 59, no. 11, pp. 7259–7267, 2013. MR3124640 [PDF]
  15. Y. M. Chee, C. J. Colbourn, D. Horsley, and J. Zhou, "Sequence covering arrays," SIAM Journal on Discrete Mathematics, vol. 27, no. 4, pp. 1844–1861, 2013. MR3120760 [PDF]
  16. Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, "Importance of symbol equity in coded modulation for power line communications," IEEE Transactions on Communications, vol. 61, no. 10, pp. 4381–4390, 2013. [PDF]
  17. Y. M. Chee, S. Ling, H. Wang, and L. F. Zhang, “Upper bounds on matching families in Z^n_{pq},” IEEE Transactions on Information Theory, vol. 59, no. 8, pp. 5131–5139, 2013. MR3078860 [PDF]
  18. Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, “Cross-bifix-free codes within a constant factor of optimality,” IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4668–4674, 2013. MR3071351 [PDF]
  19. Y. M. Chee, H. M. Kiah, and C. Wang, "Generalized balanced tournament designs with block size four," Electronic Journal of Combinatorics, vol. 20, no. 2, P51, 2013. MR3084593 [PDF]
  20. Y. M. Chee, C. J. Colbourn, A. C. H. Ling, and R. M. Wilson, “Covering and packing for pairs,” Journal of Combinatorial Theory, Series A, vol. 120, no. 7, pp. 1440–1449, 2013. MR3092675 [PDF]
  21. S. H. Dau, V. Skachek, and Y. M. Chee, “Error correction for index coding with side information,” IEEE Transactions on Information Theory, vol. 59, no. 3, pp. 1517–1531, 2013. MR3030737 [PDF]
  22. Y. M. Chee, T. Feng, S. Ling, H. Wang, and L. F. Zhang, “Query-efficient locally decodable codes of subexponential length,” Computational Complexity, vol. 22, no. 1, pp. 159–189, 2013. MR3034023 [PDF]
  23. Y. M. Chee, H. M. Kiah, and P. Purkayastha, “Estimates on the size of symbol weight codes,” IEEE Transactions on Information Theory, vol. 59, no. 1, pp. 301--314, 2013. MR3008149 [PDF]
  24. Y. M. Chee and X. Zhang, “Improved constructions of frameproof codes,” IEEE Transactions on Information Theory, vol. 58, no. 8, pp. 5449--5453, 2012. MR2957442 [PDF]
  25. S. H. Dau, V. Skachek, and Y. M. Chee, “On the security of index coding with side information,” IEEE Transactions on Information Theory, vol. 58, no. 6, pp. 3975–3988, 2012. MR2924417 [PDF]
  26. A. Beimel, Y. M. Chee, H. Wang, and L. F. Zhang, “Communication-efficient distributed oblivious transfer,” Journal of Computer and System Sciences, vol. 78, no. 4, pp. 1142–1157, 2012. MR2900529 [PDF]
  27. Y. M. Chee, H. Wang, and L. F. Zhang, “On the Bringer-Chabanne EPIR protocol for polynomial evaluation,” Journal of Mathematical Cryptology, vol. 5, no. 3–4, pp. 277–301, 2012. MR2876203 [PDF]
  28. Z. Zhang, Y. M. Chee, S. Ling, M. Liu, and H. Wang, “Threshold changeable secret sharing schemes revisited,” Theoretical Computer Science, vol. 418, pp. 106–115, 2012. MR2885882 [PDF]
  29. Y. M. Chee, L. Ji, A. Lim, and A. K. H. Tung, “Arboricity: an acyclic hypergraph decomposition problem motivated by database theory,” Discrete Applied Mathematics, vol. 160, no. 1–2, pp. 100–107, 2012. MR2864888 [PDF]
  30. Y. M. Chee, S. Ling, Y. Tan, and X. Zhang, “Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences,” Mathematics of Computation, vol. 81, no. 277, pp. 585–603, 2012. MR2833510 (2012h:05044) [PDF]
  31. Y. M. Chee, G. Ge, L. Ji, S. Ling, and J. Yin, “List decodability at small radii,” Designs, Codes and Cryptography, vol, 61, no. 2, pp. 151–166, 2011. MR2826954 [PDF]
  32. J.-C. Bermond, Y. M. Chee, N. Cohen, X. Zhang, “The α-arboricity of complete uniform hypergraphs,” SIAM Journal on Discrete Mathematics, vol. 34, no. 2, pp. 600–610, 2011. MR2817518 [PDF]
  33. Y. M. Chee, Y. Tan, and X. D. Zhang, “Strongly regular graphs constructed from p-ary bent functions,” Journal of Algebraic Combinatorics, vol. 34, no. 2, pp. 251–266, 2011. MR2811149 [PDF]
  34. Y. Chang, Y. M. Chee, and J. Zhou, “A pair of disjoint 3-GDDs of type g^t u^1,” Designs, Codes and Cryptography, vol. 60, no. 1, pp. 37–62, 2011. MR2795747 (2012g:05030) [PDF]
  35. Y. M. Chee, X. Zhang, and H. Zhang, “Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order,” Advances in Mathematics of Communications, vol. 5, no. 1, pp. 59–68, 2011. MR2770100 (2012b:94119) [PDF]
  36. Y. M. Chee, A. C. H. Ling, and J. Yin, “Optimal partitioned cyclic difference packings for frequency hopping and code synchronization,” IEEE Transactions on Information Theory, vol. 56, no. 11, pp. 5738–5746, 2010. MR2808926 (2012c:94142) [PDF]
  37. Y. M. Chee, C. Xing, and S. L. Yeo, “New constant-weight codes from propagation rules,” IEEE Transactions on Information Theory, vol. 56, no. 4, pp. 1596–1599, 2010. MR2648794 (2010m:94153) [PDF]
  38. Y. M. Chee, G. Ge, and A. C. H. Ling, “Spectrum of sizes for perfect deletion-correcting codes,” SIAM Journal on Discrete Mathematics, vol. 24, no. 1, pp. 33–55, 2010. MR2600651 (2011c:94078) [PDF]
  39. Y. M. Chee, S. H. Dau, A. C. H. Ling, and S. Ling, “Linear size optimal q-ary constant-weight codes and constant-composition codes,” IEEE Transactions on Information Theory, vol. 56, no. 1, pp. 140–151, 2010. MR2589435 (2010g:94171) [PDF]
  40. Y. M. Chee and A. C. H. Ling, “Limit on the addressability of fault-tolerant nanowire decoders,” IEEE Transactions on Computers, vol. 58, no. 1, pp. 60–68, 2009. MR2655086 [PDF]
  41. Y. M. Chee, G. Ge, and A. C. H. Ling, “Group divisible codes and their application in the construction of optimal constant-composition codes of weight three,” IEEE Transactions on Information Theory, vol. 54, no. 8, pp. 3552–3564, 2008. MR2451013 (2009g:94137) [PDF]
  42. Y. M. Chee, A. C. H. Ling, and H. Shen, “The fine intersection problem for Steiner triple systems,” Graphs and Combinatorics, vol. 24, no. 3, pp. 149–157, 2008. MR2410937 (2009c:05030) [PDF]
  43. Y. M. Chee, S. H. Dau, A. C. H. Ling, and S. Ling, “The sizes of optimal q-ary codes of weight three and distance four: a complete solution,” IEEE Transactions on Information Theory, vol. 54, no. 3, pp. 1291–1295, 2008. MR2445067 (2010e:94279) [PDF]
  44. Y. M. Chee and S. Ling, “Improved lower bounds for constant GC-content DNA codes,” IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 391–394, 2008. MR2446762 (2009k:68056) [PDF]
  45. Y. M. Chee and P. Kaski, “An enumeration of graphical designs,” Journal of Combinatorial Designs, vol. 16, no. 1, pp. 70–85, 2008. MR2369997 (2008j:05049) [PDF]
  46. Y. M. Chee and A. C. H. Ling, “On extremal k-graphs without repeated copies of 2-intersecting edges,” SIAM Journal on Discrete Mathematics, vol. 21, no. 3, pp. 805–821, 2007. MR2354008 (2008k:05197) [PDF]
  47. Y. M. Chee, A. C. H. Ling, S. Ling, and H. Shen, “The PBD-closure of constant-composition codes,” IEEE Transactions on Information Theory, vol. 53, no. 8, pp. 2685–2692, 2007. MR2400489 (2009b:94036) [PDF]
  48. Y. M. Chee, “A new lower bound for A(17,6,6),” Ars Combinatoria, vol. 83, pp. 361–363, 2007. MR2305773 (2007m:94200) [PDF]
  49. Y. M. Chee and S. Ling, “Constructions for q-ary constant-weight codes,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 135–146, 2007. MR2292879 (2009a:94041) [PDF]
  50. Y. M. Chee, “Steiner triple systems intersecting in pairwise disjoint blocks,” Electronic Journal of Combinatorics, vol. 11, no. 1, Research Paper 27, 17 pp. (electronic), 2004. MR2056079 (2005b:05031) [PDF]
  51. H. K. Aw, Y. M. Chee, and A. C. H. Ling, “Six new constant weight binary codes,” Ars Combinatoria, vol. 67, pp. 313–318, 2003. MR1973247 [PDF]
  52. Y. M. Chee and A. C. H. Ling, “Uniform group divisible designs with block sizes three and n,” Graphs and Combinatorics, vol. 18, no. 3, pp. 421–445, 2002. MR1939066 (2003g:05026) [PDF]
  53. Y. M. Chee and S. Ling, “Highly symmetric expanders,” Finite Fields and Their Applications, vol. 8, no. 3, pp. 294–310, 2002. MR1910393 (2003e:68106) [PDF]
  54. Y. M. Chee, “An improved finiteness theorem for graphical t-designs,” Discrete Mathematics, vol. 237, no. 1-3, pp. 185–186, 2001. MR1835659 (2002c:05030) [PDF]
  55. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Asymptotically optimal erasure-resilient codes for large disk arrays,” Discrete Applied Mathematics, vol. 102, no. 1-2, pp. 3–36, 2000. MR1758334 (2001i:68038) [PDF]
  56. Y. M. Chee and S. Ling, “Combinatorial coverings from geometries over principal ideal rings,” Journal of Combinatorial Designs, vol. 7, no. 4, pp. 247–268, 1999. MR1691409 (2000f:51006) [PDF]
  57. Y. M. Chee and S. S. Magliveras, “A few more large sets of t-designs,” Journal of Combinatorial Designs, vol. 6, no. 4, pp. 293–308, 1998. MR1623652 (99a:05021) [PDF]
  58. Y. M. Chee and C. J. Colbourn, “Constructions for difference triangle sets,” IEEE Transactions on Information Theory, vol. 43, no. 4, pp. 1346–1349, 1997. MR1454970 (98j:05029) [PDF]
  59. Y. M. Chee, C. J. Colbourn, R. P. Gallant, and A. C. H. Ling, “On a problem of Hartman and Heinrich concerning pairwise balanced designs with holes,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 23, pp. 121–127, 1997. MR1432752 (97h:05020) [PDF]
  60. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Weakly union-free twofold triple systems,” Annals of Combinatorics, vol. 1, no. 3, pp. 215–225, 1997. MR1630767 (99g:05137) [PDF]
  61. A. Lim and Y.-M. Chee, “On the link upgrade problem for trees,” Journal of Combinatorics, Information & System Sciences., vol. 21, no. 1, pp. 5–14, 1996. MR1736600
  62. A. Lim, Y.-M. Chee, and W. Hsu, “Upgrading links for performance,” Informatica (Vilnius), vol. 7, no. 4, pp. 455–468, 1996. MR1442433 (97m:68020)
  63. Y. M. Chee, “Some simple three-designs of small order,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 16, pp. 163–164, 1994. MR1301218 (95h:05019)
  64. A. Lim, Y. M. Chee, and S. W. Cheng, “Single jog minimum area joining of compacted cells,” Information Processing Letters, vol. 47, no. 4, pp. 167–172, 1993. MR1238386 [PDF]
  65. Y. M. Chee, “The existence of a simple 3-(28,5,30) design,” Discrete Mathematics, vol. 118, no. 1-3, pp. 251–252, 1993. MR1230068 [PDF]
  66. Y. M. Chee and D. L. Kreher, “4-(21,5,λ) designs from a group of order 171,” Ars Combinatoria, vol. 36, pp. 199–205, 1993. MR1246913 (94f:05012)
  67. Y. M. Chee and S. Ling, “Projective covering designs,” Bulletin of the London Mathematical Society, vol. 25, no. 3, pp. 231–239, 1993. MR1209246 (94b:05048) [PDF]
  68. Y. M. Chee, “On graphical quintuple systems,” Journal of Symbolic Computation, vol. 13, no. 6, pp. 677–681, 1992. MR1177714 (93d:05019) [PDF]
  69. Y. M. Chee and A. Lim, “The algorithmic complexity of colour switching,” Information Processing Letters, vol. 43, no. 2, pp. 63–68, 1992. MR1187391 (93g:68106) [PDF]
  70. Y. M. Chee and T. T. Png, “Scan lines and Gouraud shading for triangles,” Bulletin of the Institute of Combinatorics and its Applications, vol. 4, pp. 111–112, 1992. MR1147980
  71. Y. M. Chee and G. F. Royle, “Enumeration of small nonisomorphic 1-rotational twofold triple systems,” Mathematics of Computation, vol. 59, no. 200, pp. 609–612, 1992. MR1140647 (93a:05025) [PDF]
  72. Y. M. Chee, “Graphical t-designs with block sizes three and four,” Discrete Mathematics, vol. 91, no. 2, pp. 201–206, 1991. MR1124767 (93c:05020) [PDF]
  73. Y. M. Chee and G. F. Royle, “The 2-rotational Steiner triple systems of order 25,” Discrete Mathematics, vol. 97, no. 1-3, pp. 93–100, 1991. MR1140791 (92i:05041) [PDF]
  74. Y. M. Chee, C. J. Colbourn, S. C. Furino, and D. L. Kreher, “Large sets of disjoint t-designs,” Australasian Journal of Combinatorics, vol. 2, pp. 111–119, 1990. MR1126988 (92j:05013) [PDF]
  75. Y. M. Chee, C. J. Colbourn, and D. L. Kreher, “Simple t-designs with v ≤ 30,” Ars Combinatoria, vol. 29, pp. 193–258, 1990. MR1046108 (91b:05028) [PDF]
  76. D. L. Kreher, Y. M. Chee, D. de Caen, C. J. Colbourn, and E. S. Kramer, “Some new simple t-designs,” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 7, pp. 53–90, 1990. MR1062525 (91g:05016) [PDF]
  77. Y. M. Chee and A. Lim, “Quadrilateral-free Steiner triple systems of orders 31 and 37,” Journal of Combinatorics, Information & System Sciences, vol. 14, no. 4, pp. 244–248, 1989. MR1121807 (92c:05026) [PDF]

Conference Papers

  1. S. Feng, G. Cong, B. An, and Y. M. Chee, "POI2Vec: Geographical latent representation for predicting future visitors," in AAAI-17 – Proceedings of the 31st AAAI Conference on Artificial Intelligence, to appear, accepted Nov 2016.
  2. Y. M. Chee, H. M. Kiah, S. Ling, T. T. Nguyen, V. K. Vu, and X. Zhang, "String concatenation construction for Chebyshev permutation channel codes," in ISIT 2016 – Proceedings of the 2016 International Symposium on Information Theory, pp. 2824–2828, 2016. [PDF]
  3. Y. M. Chee, J. Chrisnata, H. M. Kiah, S. Ling, T. T. Nguyen, and V. K. Vu, "Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes," in ISIT 2016 – Proceedings of the 2016 International Symposium on Information Theory, pp. 205–209, 2016. [PDF]
  4. Y. M. Chee, J. Chrisnata, H. M. Kiah, S. Ling, T. T. Nguyen, and V. K. Vu, "Rates of constant-composition codes that mitigate intercell interference," in ISIT 2016 – Proceedings of the 2016 International Symposium on Information Theory, pp. 200–204, 2016. [PDF]
  5. S. Feng, T. Xu, Y. Zeng, G. Cong, Y. M. Chee, and Q. Yuan, "Personalized ranking metric embedding for next new POI recommendation," in IJCAI-15 – Proceedings of the 2015 International Joint Conference on Artificial Intelligence, pp. 2069–2075, 2015. [PDF]
  6. Y. M. Chee, Y. Li, and X. Zhang, "Spectrum of sizes for perfect burst delection-correcting codes," in ISIT 2015 – Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 1931–1935, 2015. [PDF]
  7. Y. M. Chee, V. K. Vu, and X. Zhang, "Permutation codes correcting a single burst deletion I: unstable deletions," in ISIT 2015 – Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 1741–1745, 2015. [PDF]
  8. Y. M. Chee, F. Gao, S. T. H. Teo, and H. Zhang, "Combinatorial systematic switch codes," in ISIT 2015 – Proceedings of the 2015 IEEE International Symposium on Information Theory, pp. 241–245, 2015. [PDF]
  9. S. Feng, X. Chen, G. Cong, Y. Zeng, Y. M. Chee, and Y. Xiang, “Influence maximization with novelty decay in social networks," in AAAI-14 – Proceedings of the 28th AAAI Conference on Artificial Intelligence, pp. 37–43, 2014. [PDF]
  10. Y. M. Chee, L. Wu, and C. Xing, “Correcting on curves and highly sound locally correctable codes of high rate," in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2964–2966, 2014. [PDF]
  11. Y. M. Chee and V. K. Vu, “Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics," in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2959–2963, 2014. [PDF]
  12. Y. M. Chee, H. M. Kiah, and P. Purkayastha, “Rewritable coset coding for flash memories," in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 2082–2086, 2014. [PDF]
  13. Y. M. Chee, H. M. Kiah, P. Purkayastha, and P. Solé, “Product construction of affine codes," in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 1441–1445, 2014. [PDF]
  14. Y. M. Chee, F. Gao, H. M. Kiah, A. C. H. Ling, H. Zhang, and X. Zhang, “Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families," in ISIT 2014 – Proceedings of the 2014 IEEE International Symposium on Information Theory, pp. 1436–1440, 2014. [PDF]
  15. Y. M. Chee, H. M. Kiah, and P. Purkayastha, “Matrix codes and multitone frequency shift keying for power line communications,” in ISIT 2013 – Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 2870–2874, 2013. [PDF]
  16. Y. M. Chee, H. Zhang, and X. Zhang, “Complexity of dependencies in bounded domains, Armstrong codes, and generalizations,” in ISIT 2013 – Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 499–503, 2013. [PDF]
  17. Y. M. Chee, H. M. Kiah, H. Zhang, and X. Zhang, “Optimal codes in the Enomoto-Katona space,” in ISIT 2013 – Proceedings of the 2013 IEEE International Symposium on Information Theory, pp. 321–325, 2013. [PDF]
  18. Y. M. Chee, H. M. Kiah, C. Wang, “Maximum distance separable symbol-pair codes,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 2896–2900, 2012. [PDF]
  19. S. H. Dau, V. Skachek, and Y. M. Chee, “Optimal index codes with near-extreme rates,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 2251–2255, 2012. [PDF]
  20. Y. M. Chee, H. M. Kiah, A. C. H. Ling, and C. Wang, “Optimal equitable symbol weight codes for power line communications,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 671–675, 2012. [PDF]
  21. Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, “Importance of symbol equity in coded modulation for power line communications,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 666–670, 2012. Student Paper Award finalist. [PDF]
  22. Y. M. Chee and P. Purkayastha, “Efficient decoding of permutation codes obtained from distance preserving maps,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 641–645, 2012. [PDF]
  23. C. Bracken, Y. M. Chee, and P. Purkayastha, “Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices,” in ISIT 2012 – Proceedings of the 2012 IEEE International Symposium on Information Theory, pp. 116–119, 2012. [PDF]
  24. Y. M. Chee, H. Wang, and L. F. Zhang, “Oblivious transfer and n-variate linear function evaluation,” in Computing an Combinatorics – Proceedings of the 17th Annual International Conference, COCOON 2011 (B. Fu and D.-Z. Du, eds.), vol. 6842 of Lecture Notes in Computer Science, pp. 627-637, Springer-Verlag, 2011. MR2875083 [PDF]
  25. S. H. Dau, V. Skachek, and Y. M. Chee, “Index coding and error correction,” in ISIT 2011 – Proceedings of the 2011 IEEE International Symposium on Information Theory, pp. 1753–1757, 2011. [PDF]
  26. S. H. Dau, V. Skachek, and Y. M. Chee, “On secure index coding with side information,” in ISIT 2011 – Proceedings of the 2011 IEEE International Symposium on Information Theory, pp. 1046–1050, 2011. [PDF]
  27. Y. M. Chee, Y. Tan, and Y. Zhou, “Almost p-ary perfect sequences,” in SETA 2010 – Proceedings of the 6th Conference on Sequences and Their Applications (C. Carlet and A. Pott, eds.), vol. 6338 of Lecture Notes in Computer Science, pp. 399–415, Springer-Verlag, 2010. [PDF]
  28. D. Zhang, Y. M. Chee, A. Mondal, A. K. H. Tung and M. Kitsuregawa, “Keyword search in spatial databases: towards searching by document,” in ICDE 2009 – Proceedings of the IEEE 25th International Conference on Data Engineering, pp. 388-399, IEEE Computer Society, 2009. [PDF]
  29. Z. Zhang, M. Liu, Y. M. Chee, S. Ling, and H. Wang, “Strongly multiplicative and 3-multiplicative linear secret sharing schemes,” in Advances in Cryptology – ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology & Information Security, vol. 5350 of Lecture Notes in Computer Science, pp. 19-36, Springer-Verlag, 2008. MR2546085 [PDF]
  30. Y. M. Chee and C. J. Colbourn, “Scalable optimal test patterns for crosstalk-induced faults on deep submicron global interconnects,” in Proceedings of the 1st International Workshop on Coding & Cryptology, pp. 80-90, World Scientific, 2008. MR2484852 [PDF]
  31. Y. M. Chee, C. J. Colbourn, and A. C. H. Ling, “Optimal memoryless encoding for low power off-chip data buses,” in ICCAD 2006: Proceedings of the IEEE/ACM 2006 International Conference on Computer-Aided Design, pp. 369–374, ACM Press, 2006. [Paper in PDF] [Presentation in PDF]
  32. Y. M. Chee and S. Ling, “Algebraic constructions of Ramanujan graphs and highly symmetric expanders,” in Proceedings of the Second Asian Mathematical Conference 1995 (Nakhon Ratchasima), (River Edge, NJ), pp. 276–282, World Sci. Publishing, 1998. MR1660579 (99k:68131)
  33. A. Lim, Y. M. Chee, and W. Hsu, “Upgrading links for performance,” in Proceedings of the IEEE Singapore International Conference on Networks, pp. 398–402, 1995. [PDF]
  34. S. H. Goh, Y. M. Chee, and M. Yap, “Security and management in IT2000,” in Proceedings of the First Privacy and Security Research Group Workshop on Network and Distributed System Security, pp. 11–28, 1993. [PDF]
  35. Y. M. Chee and A. Lim, “A complex approach to the security of statistical databases subject to off-line sum queries,” in IFIP/Sec ’92: Proceedings of the IFIP TC11, Eigth International Conference on Information Security (G. G. Gable and W. J. Caelli, eds.), vol. A-15 of IFIP Transactions, pp. 373–384, North-Holland, 1992.
  36. A. Lim, Y. M. Chee, and C. T. Wu, “Performance driven placement with global routing for macro cells,” in Proceedings of the Second Great Lakes Symposium on VLSI, pp. 35–41, 1992. [PDF]
  37. Y. M. Chee, A. Joux, and J. Stern, “The cryptanalysis of a new public-key cryptosystem based on modular knapsacks.,” in Advances in Cryptology – CRYPTO ’91, 11th Annual International Cryptology Conference (J. Feigenbaum, ed.), vol. 576 of Lecture Notes in Computer Science, pp. 204–212, Springer-Verlag, 1992. [PDF]
  38. Y. M. Chee, H. W. Leong, A. Lim, and C. P. Low, “Simulated annealing algorithm for the fault-covering of redundant RAMs,” in Proceedings of the 24th IEEE International Symposium on Circuits and Systems, pp. 2144–2147, 1991. [PDF]
  39. A. Lim and Y. M. Chee, “Graph partitioning using tabu search,” in Proceedings of the 24th IEEE International Symposium on Circuits and Systems, pp. 1164–1167, 1991. [PDF]

Book Chapters (Refereed)

  1. Y. M. Chee and D. L. Kreher, “Graphical designs,” in The CRC Handbook of Combinatorial Designs (C. J. Colbourn and J. H. Dinitz, eds.), pp. 490-493, Boca Raton: CRC Press, 2nd ed., 2007.
  2. Y. M. Chee, “Graphical designs,” in The CRC Handbook of Combinatorial Designs (C. J. Colbourn and J. H. Dinitz, eds.), pp. 367–369, Boca Raton: CRC Press, 1996.

Books Edited

  1. Y. M. Chee, Z. Guo, S. Ling, F. Shao, Y. Tang, H. Wang, and C. Xing, “Coding and Cryptology”, vol. 6639 of Lecture Notes in Computer Science, Springer-Verlag, 2011.
  2. Y. M. Chee, C. Li, S. Ling, H. Wang, and C. Xing, “Coding and Cryptology”, vol. 5557 of Lecture Notes in Computer Science, Springer-Verlag, 2009.

Theses

  1. Y. M. Chee, “Turán-type problems in group testing, coding theory, and cryptography”, Ph.D. Thesis, Department of Computer Science, University of Waterloo, Canada, 1996. [PDF]
  2. Y. M. Chee, “The basis reduction algorithm and existence of combinatorial designs”, M.Math. Thesis, Department of Computer Science, University of Waterloo, Canada, 1989.

Students and Post-Docs

Post-Doctoral Fellows

  1. Hengjia Wei, School of Physical & Mathematical Sciences, Nanyang Technological University, 01/2016 –.
  2. Fei Gao, Institute of High Performance Computing, Agency for Science, Technology and Research, 09/2013 –.
  3. Hui Zhang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 09/2013 – 02/2015. Current location: Department of Computer Science, Technion.
  4. Cafer Caliskan, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 08/2012 – 01/2013. Current location: Department of Computer Engineering, Kadir Has University, Istanbul.
  5. Son Hoang Dau, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 08/2012 – 10/2012. Current location: Coordinated Science Lab, University of Illinois at Urbana-Champagne.
  6. Liang Feng Zhang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 03/2012 – 08/2012. Current location: Department of Computer Science, University of Calgary.
  7. Chengmin Wang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 08/2011 – 08/2012. Current location: School of Science, Jiangnan University, China.
  8. Carl Bracken, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 11/2010 – 2011.
  9. Purkayastha Punarbasu, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological Unversity, 08/2010 –.
  10. Vitaly Skachek, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 09/2009 – 01/2010. Current location: Institute of Computer Science, University of Tartu.
  11. Yin Tan, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 08/2009 – 08/2010. Current location: Department of Electrical and Computer Engineering, University of Waterloo.
  12. Xiande Zhang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 07/2009 – 07/2011, 08/2012 –. Current location: University of Science and Technology, China.

PhD Students

  1. Tuan Thanh Nguyen, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, in progress.
  2. Shanshan Feng, Interdisciplinary Graduate School, Nanyang Technological University, in progress (co-supervised with Gao Cong).
  3. Van Khu Vu, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, in progress.
  4. Liyasi Wu, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, in progress (co-supervised with Chaoping Xing).
  5. Han Mao Kiah, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 2013. Thesis title: Reliable Communications Over Power Lines Through Coded Modulation Schemes.
  6. Xinli Wang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 2012 (co-supervised with Sinai Robins). Thesis title: Discrete-Geometric Functions Associated to Polyhedral Cones and Point Sets.
  7. Son Hoang Dau, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 2012 (co-supervised with San Ling). Thesis title: On Index Coding with Side Information.
  8. Liang Feng Zhang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 2012 (co-supervised with Huaxiong Wang). Thesis title: A Study of Private Information Retrieval and Related Primitives.

Master's' Students

  1. Luchan Zhang, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 2012. Thesis title: On Uniform Partial Group Division Designs with Block Size Three.
  2. Son Hoang Dau, Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, 2008 (co-supervised with San Ling). Thesis title: On the Construction of Nonbinary Constant-Weight Codes.

Contact

School of Physical and Mathematical Sciences
Nanyang Technological University
21 Nanyang Link
Singapore 637371


ymchee@ntu.edu.sg