- GRAPHPARTITIONINGUSINGTABUSEARCH Andrew LIM* Yeow-Meng CHEEt
- Combinatorial Coverings from Geometries over Principal Ideal
- A New Lower Bound for A(17, 6, 6) Yeow Meng Chee
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2007 Society for Industrial and Applied Mathematics
- Discrete Mathematics 237 (2001) 185186 www.elsevier.com/locate/disc
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
- Digital Object Identifier (DOI) 10.1007/s00373-006-0690-z Graphs and Combinatorics (2008) 24: 149157
- J Algebr Comb DOI 10.1007/s10801-010-0270-4
- The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks
- Six New Constant Weight Binary Hui Kheng Aw
- Almost p-Ary Perfect Sequences Yeow Meng Chee1
- Keyword Search in Spatial Databases: Towards Searching by Document
- 5738 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 11, NOVEMBER 2010 Optimal Partitioned Cyclic Difference Packings for
- Steiner Triple Systems Intersecting in Pairwise Disjoint Blocks
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 3, MARCH 2008 1291 for coding. For example, for any integer i 0 and for any real number
- PROJECTIVE COVERING DESIGNS YEOW MENG CHEE AND SAN LING
- Information Processing Letters 47 (1993) 167-172 27 September 1993
- An Enumeration of Graphical Designs Yeow Meng Chee,1,2
- Optimal Memoryless Encoding for Low Power Off-Chip Data Buses Yeow Meng Chee
- UNIVERSAL CYCLES FOR MINIMUM COVERINGS OF PAIRS BY TRIPLES, WITH APPLICATION TO 2-RADIUS SEQUENCES
- Limit on the Addressability of Fault-Tolerant Nanowire Decoders
- March 28, 2008 14:5 WSPC -Proceedings Trim Size: 9in x 6in "crosstalk testing (revised)" SCALABLE OPTIMAL TEST PATTERNS FOR
- Information Processing Letters 43 (1992) 63-68 North-Holland
- A Few More Large Sets of t-Designs Yeow Meng Chee,1
- Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
- Advances in Mathematics of Communications doi:10.3934/amc.2011.5.59 Volume 5, No. 1, 2011, 5968
- 1346 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO. 4, JULY 1997 Constructions for Difference Triangle Sets
- Des. Codes Cryptogr. DOI 10.1007/s10623-010-9445-1
- Des. Codes Cryptogr. DOI 10.1007/s10623-010-9415-7
- 1596 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 4, APRIL 2010 New Constant-Weight Codes From Propagation Rules
- 140 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY 2010 Linear Size Optimal q-ary Constant-Weight Codes
- 3552 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 8, AUGUST 2008 Group Divisible Codes and Their Application in
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 1, JANUARY 2008 391 Improved Lower Bounds for Constant GC-Content
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 8, AUGUST 2007 2685 The PBD-Closure of Constant-Composition Codes
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 1, JANUARY 2007 135 Constructions for q-Ary Constant-Weight Codes
- Finite Fields and Their Applications 8, 294}310 (2002) doi:10.1006/!ta.2001.0341
- Discrete Applied Mathematics 102 (2000) 336 Asymptotically optimal erasure-resilient codes for large
- Annals of Combinatorics 1 (1997) 215-225 Combinatorics
- Enumeration of Small Nonisomorphic 1-Rotational Twofold Triple Systems Yeow Meng Chee; Gordon F. Royle
- Discrete Mathematics 91 (1991) 201-206 North-Holland
- Upgrading Links For Performance * Andrew Limtl Yeow Meng Cheet Wynne ~ s u f
- SECURITY AND MANAGEMENT IN IT2000 Seow-Hiong Goh
- SIMULATED ANNEALING ALGORITHM FOR THE FAULT COVERING OF REDUNDANT RAMS
- Discrete Mathematics 97 (1991) 93-100 North-Holland
- Query-Efficient Locally Decodable Codes 1 QUERY-EFFICIENT LOCALLY
- Uniform Group Divisible Designs with Block Sizes Three and n*
- Discrete Mathematics 118 (1993) 251-252 North-Holland
- Index Coding and Error Correction Son Hoang Dau
- THE -ARBORICITY OF COMPLETE UNIFORM HYPERGRAPHS* J.-C. BERMOND
- Arboricity: an Acyclic Hypergraph Decomposition Problem Motivated by Database Theory
- On Secure Index Coding with Side Information Son Hoang Dau
- Oblivious Transfer and n-Variate Linear Function Evaluation
- Threshold Changeable Secret Sharing Schemes Revisited$ Zhifang Zhanga,1
- J. Math. Cryptol. 5 (2011), 277301 DOI 10.1515/jmc-2012-0001 de Gruyter 2012
