Yeow Meng Chee

According to our database1, Yeow Meng Chee authored at least 127 papers between 1990 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming.
IEEE Trans. Inf. Theory, 2021

Serverless Model Serving for Data Science.
CoRR, 2021

2020
Burst-Deletion-Correcting Codes for Permutations and Multipermutations.
IEEE Trans. Inf. Theory, 2020

Efficient and Explicit Balanced Primer Codes.
IEEE Trans. Inf. Theory, 2020

Explicit and Efficient WOM Codes of Finite Length.
IEEE Trans. Inf. Theory, 2020

Low-Power Cooling Codes With Efficient Encoding and Decoding.
IEEE Trans. Inf. Theory, 2020

Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications.
IEEE Trans. Inf. Theory, 2020

Robust Positioning Patterns with Low Redundancy.
SIAM J. Comput., 2020

Access balancing in storage systems by labeling partial Steiner systems.
Des. Codes Cryptogr., 2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.
CoRR, 2020

Codes Correcting Synchronization Errors for Symbol-Pair Read Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Recovery Sets for Subspaces from a Vector Space.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories.
IEEE Trans. Inf. Theory, 2019

Deciding the Confusability of Words under Tandem Repeats in Linear Time.
ACM Trans. Algorithms, 2019

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families.
SIAM J. Discret. Math., 2019

Optimal Codes Correcting a Single Indel / Edit for DNA-Based Data Storage.
CoRR, 2019

Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Endurance-Limited Memories with Informed Decoder.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Coding for Write ℓ-step-up Memories.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Optimal q-Ary Error Correcting/All Unidirectional Error Detecting Codes.
IEEE Trans. Inf. Theory, 2018

Linear Size Constant-Composition Codes Meeting the Johnson Bound.
IEEE Trans. Inf. Theory, 2018

Coding for Racetrack Memories.
IEEE Trans. Inf. Theory, 2018

Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes.
IEEE Trans. Inf. Theory, 2018

Cooling Codes: Thermal-Management Coding for High-Performance Interconnects.
IEEE Trans. Inf. Theory, 2018

Reconstruction from Deletions in Racetrack Memories.
Proceedings of the IEEE Information Theory Workshop, 2018

Codes for Endurance-Limited Memories.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Codes Correcting Limited-Shift Errors in Racetrack Memories.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Inf2vec: Latent Representation Model for Social Influence Embedding.
Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2017

Codes correcting position errors in racetrack memories.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Permutation codes correcting a single burst deletion II: Stable deletions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Explicit constructions of finite-length WOM codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Geometric orthogonal codes better than optical orthogonal codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

POI2Vec: Geographical Latent Representation for Predicting Future Visitors.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
String concatenation construction for Chebyshev permutation channel codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rates of constant-composition codes that mitigate intercell interference.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations.
IEEE Trans. Inf. Theory, 2015

Product Construction of Affine Codes.
SIAM J. Discret. Math., 2015

Hanani triple packings and optimal q-ary codes of constant weight three.
Des. Codes Cryptogr., 2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.
Des. Codes Cryptogr., 2015

Optimal Codes in the Enomoto-Katona Space.
Comb. Probab. Comput., 2015

Linear Size Constant-Composition Codes.
CoRR, 2015

Polynomial Time Algorithm for Min-Ranks of Graphs with Simple Tree Structures.
Algorithmica, 2015

Permutation codes correcting a single burst deletion I: Unstable deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Spectrum of sizes for perfect burst deletion-correcting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Combinatorial systematic switch codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Personalized Ranking Metric Embedding for Next New POI Recommendation.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Influence Spreading Path and Its Application to the Time Constrained Social Influence Maximization Problem and Beyond.
IEEE Trans. Knowl. Data Eng., 2014

Optimal Index Codes With Near-Extreme Rates.
IEEE Trans. Inf. Theory, 2014

Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions.
IEEE Trans. Inf. Theory, 2014

Correcting on curves and highly sound locally correctable codes of high rate.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Rewritable coset coding for flash memories.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Influence Maximization with Novelty Decay in Social Networks.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Error Correction for Index Coding With Side Information.
IEEE Trans. Inf. Theory, 2013

Upper Bounds on Matching Families in BBZ<sub>pq</sub><sup>n</sup>.
IEEE Trans. Inf. Theory, 2013

Cross-Bifix-Free Codes Within a Constant Factor of Optimality.
IEEE Trans. Inf. Theory, 2013

Estimates on the Size of Symbol Weight Codes.
IEEE Trans. Inf. Theory, 2013

Maximum Distance Separable Codes for Symbol-Pair Read Channels.
IEEE Trans. Inf. Theory, 2013

Importance of Symbol Equity in Coded Modulation for Power Line Communications.
IEEE Trans. Commun., 2013

Sequence Covering Arrays.
SIAM J. Discret. Math., 2013

Covering and packing for pairs.
J. Comb. Theory, Ser. A, 2013

Upper Bounds on Matching Families in $\mathbb{Z}_{pq}^n$
CoRR, 2013

Generalized Balanced Tournament Designs with Block Size Four.
Electron. J. Comb., 2013

Query-Efficient Locally Decodable Codes of Subexponential Length.
Comput. Complex., 2013

Matrix codes and multitone frequency shift keying for power line communications.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Complexity of dependencies in bounded domains, Armstrong Codes, and generalizations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
On the Security of Index Coding With Side Information.
IEEE Trans. Inf. Theory, 2012

Improved Constructions of Frameproof Codes.
IEEE Trans. Inf. Theory, 2012

Threshold changeable secret sharing schemes revisited.
Theor. Comput. Sci., 2012

Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences.
Math. Comput., 2012

On the Bringer-Chabanne EPIR protocol for polynomial evaluation.
J. Math. Cryptol., 2012

Communication-efficient distributed oblivious transfer.
J. Comput. Syst. Sci., 2012

Arboricity: An acyclic hypergraph decomposition problem motivated by database theory.
Discret. Appl. Math., 2012

Efficient decoding of permutation codes obtained from distance preserving maps.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Maximum distance separable symbol-pair codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Optimal equitable symbol weight codes for power line communications.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
The α-Arboricity of Complete Uniform Hypergraphs.
SIAM J. Discret. Math., 2011

List decodability at small radii.
Des. Codes Cryptogr., 2011

A pair of disjoint 3-GDDs of type <i>g</i><sup><i>t</i></sup><i>u</i><sup>1</sup>.
Des. Codes Cryptogr., 2011

Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order.
Adv. Math. Commun., 2011

Index coding and error correction.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On secure Index Coding with Side Information.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Oblivious Transfer and n-Variate Linear Function Evaluation.
Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010
New constant-weight codes from propagation rules.
IEEE Trans. Inf. Theory, 2010

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization.
IEEE Trans. Inf. Theory, 2010

Linear size optimal q-ary constant-weight codes and constant-composition codes.
IEEE Trans. Inf. Theory, 2010

Spectrum of Sizes for Perfect Deletion-Correcting Codes.
SIAM J. Discret. Math., 2010

Query-Efficient Locally Decodable Codes.
Electron. Colloquium Comput. Complex., 2010

Almost <i>p</i>-Ary Perfect Sequences.
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009
Limit on the Addressability of Fault-Tolerant Nanowire Decoders.
IEEE Trans. Computers, 2009

Keyword Search in Spatial Databases: Towards Searching by Document.
Proceedings of the 25th International Conference on Data Engineering, 2009

2008
Improved Lower Bounds for Constant GC-Content DNA Codes.
IEEE Trans. Inf. Theory, 2008

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three.
IEEE Trans. Inf. Theory, 2008

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution.
IEEE Trans. Inf. Theory, 2008

The Fine Intersection Problem for Steiner Triple Systems.
Graphs Comb., 2008

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes.
Proceedings of the Advances in Cryptology, 2008

2007
The PBD-Closure of Constant-Composition Codes.
IEEE Trans. Inf. Theory, 2007

Constructions for q-Ary Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2007

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges.
SIAM J. Discret. Math., 2007

A New Lower Bound for A(17,6,6)
CoRR, 2007

A New Lower Bound for A(17, 6, 6).
Ars Comb., 2007

2006
Optimal memoryless encoding for low power off-chip data buses.
Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

2004
Steiner Triple Systems Intersecting in Pairwise Disjoint Blocks.
Electron. J. Comb., 2004

2003
Six New Constant Weight Binary Codes.
Ars Comb., 2003

2002
Uniform Group Divisible Designs with Block Sizes Three and n.
Graphs Comb., 2002

2001
An improved finiteness theorem for graphical <i>t</i>-designs.
Discret. Math., 2001

2000
Asymptotically optimal erasure-resilient codes for large disk arrays.
Discret. Appl. Math., 2000

1997
Constructions for difference triangle sets.
IEEE Trans. Inf. Theory, 1997

1993
Single Jog Minimum Area Joining of Compacted Cells.
Inf. Process. Lett., 1993

The existence of a simple 3-(28, 5, 30) design.
Discret. Math., 1993

1992
On Graphical Quintuple Systems.
J. Symb. Comput., 1992

The Algorithmic Complexity of Colour Switching.
Inf. Process. Lett., 1992

A Complex Approach to the Security of Statistical Databases Subject to Off-line Sum Queries.
Proceedings of the IT Security: The Need for International Cooperation, 1992

Performance driven placement with global routing for macro cells.
Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991
The 2-rotational Steiner triple systems of order 25.
Discret. Math., 1991

Graphical t-designs with block sizes three and four.
Discret. Math., 1991

The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks.
Proceedings of the Advances in Cryptology, 1991

1990
Large sets of disjoint t-designs.
Australas. J Comb., 1990


  Loading...