Yeow Meng Chee

IEEE Trans. Inf. Theory, August, 2023

Transverse-Read-Codes for Domain Wall Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry.

[BibT_eX]

[DOI]

Hoang Ta

CoRR, 2023

FLAC: Practical Failure-Aware Atomic Commit Protocol for Distributed Transactions.

[BibT_eX]

[DOI]

CoRR, 2023

Domination mappings into the hamming ball: Existence, constructions, and algorithms.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Learning to Search Feasible and Infeasible Regions of Routing Problems with Flexible Neural k-Opt.

[BibT_eX]

[DOI]

Yining Ma

Zhiguang Cao

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Maximal Length Constrained de Bruijn Sequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Thermal-Aware Channel Capacity.

[BibT_eX]

[DOI]

Tuvi Etzion

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Endurance-Limited Memories: Capacity and Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A new framework for deniable secure key exchange.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Federated Best Arm Identification with Heterogeneous Clients.

[BibT_eX]

[DOI]

CoRR, 2022

Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight.

[BibT_eX]

[DOI]

CoRR, 2022

Neural Network Decoders for Permutation Codes Correcting Different Errors.

[BibT_eX]

[DOI]

CoRR, 2022

Serverless Data Science - Are We There Yet? A Case Study of Model Serving.

[BibT_eX]

[DOI]

Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

Learning Generalizable Models for Vehicle Routing Problems via Knowledge Distillation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Noisy Interactive Graph Search.

[BibT_eX]

[DOI]

Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

Using One Redundant Bit to Construct Two-Dimensional Almost-Balanced Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Robust Locally Positioning Sequences and Codes: Capacity, Constructions and Applications.

[BibT_eX]

[DOI]

Nhat Hoang Le

Proceedings of the IEEE International Symposium on Information Theory, 2022

Run Length Limited de Bruijn Sequences for Quantum Communications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Group Testing with Blocks of Positives.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficient Neural Neighborhood Search for Pickup and Delivery Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Cost-Effective Algorithms for Average-Case Interactive Graph Search.

[BibT_eX]

[DOI]

Proceedings of the 38th IEEE International Conference on Data Engineering, 2022

Primitive3D: 3D Object Dataset Synthesis from Randomly Assembled Primitives.

[BibT_eX]

[DOI]

Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2022

2021

Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Serverless Model Serving for Data Science.

[BibT_eX]

[DOI]

CoRR, 2021

Efficient Design of Capacity-Approaching Two-Dimensional Weight-Constrained Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coding for Transverse-Reads in Domain Wall Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Two Dimensional Deletion Correcting Codes and their Applications.

[BibT_eX]

[DOI]

Manabu Hagiwara

Proceedings of the IEEE International Symposium on Information Theory, 2021

Regular Multiset Combinatorial Batch Codes over Vector Spaces.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Burst-Deletion-Correcting Codes for Permutations and Multipermutations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Efficient and Explicit Balanced Primer Codes.

[BibT_eX]

[DOI]

Hengjia Wei

IEEE Trans. Inf. Theory, 2020

Explicit and Efficient WOM Codes of Finite Length.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Low-Power Cooling Codes With Efficient Encoding and Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Robust Positioning Patterns with Low Redundancy.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Access balancing in storage systems by labeling partial Steiner systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

Codes Correcting Synchronization Errors for Symbol-Pair Read Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Recovery Sets for Subspaces from a Vector Space.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Deciding the Confusability of Words under Tandem Repeats in Linear Time.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

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

[BibT_eX]

[DOI]

CoRR, 2019

Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Endurance-Limited Memories with Informed Decoder.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

A Generalization of the Blackburn-Etzion Construction for Private Information Retrieval Array Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Coding for Write ℓ-step-up Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Linear-Time Encoders for Codes Correcting a Single Edit for DNA-Based Data Storage.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Constrained de Bruijn Codes and their Applications.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Optimal q-Ary Error Correcting/All Unidirectional Error Detecting Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Linear Size Constant-Composition Codes Meeting the Johnson Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Coding for Racetrack Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Cooling Codes: Thermal-Management Coding for High-Performance Interconnects.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Reconstruction from Deletions in Racetrack Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Codes for Endurance-Limited Memories.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Codes Correcting Limited-Shift Errors in Racetrack Memories.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Inf2vec: Latent Representation Model for Social Influence Embedding.

[BibT_eX]

[DOI]

Proceedings of the 34th IEEE International Conference on Data Engineering, 2018

2017

Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Codes correcting position errors in racetrack memories.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Permutation codes correcting a single burst deletion II: Stable deletions.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Explicit constructions of finite-length WOM codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Geometric orthogonal codes better than optical orthogonal codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

POI2Vec: Geographical Latent Representation for Predicting Future Visitors.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

String concatenation construction for Chebyshev permutation channel codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Efficient encoding/decoding of capacity-achieving constant-composition ICI-free codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Rates of constant-composition codes that mitigate intercell interference.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Product Construction of Affine Codes.

[BibT_eX]

[DOI]

Patrick Solé

SIAM J. Discret. Math., 2015

Hanani triple packings and optimal q-ary codes of constant weight three.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Optimal Codes in the Enomoto-Katona Space.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Linear Size Constant-Composition Codes.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Algorithmica, 2015

Permutation codes correcting a single burst deletion I: Unstable deletions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Spectrum of sizes for perfect burst deletion-correcting codes.

[BibT_eX]

[DOI]

Yang Li

Proceedings of the IEEE International Symposium on Information Theory, 2015

Combinatorial systematic switch codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Personalized Ranking Metric Embedding for Next New POI Recommendation.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2014

Optimal Index Codes With Near-Extreme Rates.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Correcting on curves and highly sound locally correctable codes of high rate.

[BibT_eX]

[DOI]

Liyasi Wu

Chaoping Xing

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.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Rewritable coset coding for flash memories.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Influence Maximization with Novelty Decay in Social Networks.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Error Correction for Index Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Upper Bounds on Matching Families in BBZpqn.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Cross-Bifix-Free Codes Within a Constant Factor of Optimality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Estimates on the Size of Symbol Weight Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Maximum Distance Separable Codes for Symbol-Pair Read Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Importance of Symbol Equity in Coded Modulation for Power Line Communications.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2013

Sequence Covering Arrays.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Covering and packing for pairs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2013

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

[BibT_eX]

[DOI]

CoRR, 2013

Generalized Balanced Tournament Designs with Block Size Four.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Query-Efficient Locally Decodable Codes of Subexponential Length.

[BibT_eX]

[DOI]

Comput. Complex., 2013

Matrix codes and multitone frequency shift keying for power line communications.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Complexity of dependencies in bounded domains, Armstrong Codes, and generalizations.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

On the Security of Index Coding With Side Information.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Improved Constructions of Frameproof Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Threshold changeable secret sharing schemes revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

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

[BibT_eX]

[DOI]

Math. Comput., 2012

On the Bringer-Chabanne EPIR protocol for polynomial evaluation.

[BibT_eX]

[DOI]

Huaxiong Wang

Liang Feng Zhang

J. Math. Cryptol., 2012

Communication-efficient distributed oblivious transfer.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2012

Arboricity: An acyclic hypergraph decomposition problem motivated by database theory.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Efficient decoding of permutation codes obtained from distance preserving maps.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Maximum distance separable symbol-pair codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Optimal equitable symbol weight codes for power line communications.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Carl Bracken

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

The α-Arboricity of Complete Uniform Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

List decodability at small radii.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2011

A pair of disjoint 3-GDDs of type gtu1.

[BibT_eX]

[DOI]

Yanxun Chang

Junling Zhou

Des. Codes Cryptogr., 2011

Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

Index coding and error correction.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On secure Index Coding with Side Information.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Oblivious Transfer and n-Variate Linear Function Evaluation.

[BibT_eX]

[DOI]

Huaxiong Wang

Liang Feng Zhang

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

New constant-weight codes from propagation rules.

[BibT_eX]

[DOI]

Chaoping Xing

Sze Ling Yeo

IEEE Trans. Inf. Theory, 2010

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization.

[BibT_eX]

[DOI]

Jianxing Yin

IEEE Trans. Inf. Theory, 2010

Linear size optimal q-ary constant-weight codes and constant-composition codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Spectrum of Sizes for Perfect Deletion-Correcting Codes.

[BibT_eX]

[DOI]

Gennian Ge

SIAM J. Discret. Math., 2010

Query-Efficient Locally Decodable Codes.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2010

Almost p-Ary Perfect Sequences.

[BibT_eX]

[DOI]

Yin Tan

Yue Zhou

Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009

Limit on the Addressability of Fault-Tolerant Nanowire Decoders.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 2009

Keyword Search in Spatial Databases: Towards Searching by Document.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Data Engineering, 2009

2008

Improved Lower Bounds for Constant GC-Content DNA Codes.

[BibT_eX]

[DOI]

San Ling

IEEE Trans. Inf. Theory, 2008

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three.

[BibT_eX]

[DOI]

Gennian Ge

IEEE Trans. Inf. Theory, 2008

The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

The Fine Intersection Problem for Steiner Triple Systems.

[BibT_eX]

[DOI]

Hao Shen

Graphs Comb., 2008

Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

The PBD-Closure of Constant-Composition Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Constructions for q-Ary Constant-Weight Codes.

[BibT_eX]

[DOI]

San Ling

IEEE Trans. Inf. Theory, 2007

On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

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

[BibT_eX]

[DOI]

CoRR, 2007

A New Lower Bound for A(17, 6, 6).

[BibT_eX]

Ars Comb., 2007

2006

Optimal memoryless encoding for low power off-chip data buses.

[BibT_eX]

[DOI]

Charles J. Colbourn

Proceedings of the 2006 International Conference on Computer-Aided Design, 2006

2004

Steiner Triple Systems Intersecting in Pairwise Disjoint Blocks.

[BibT_eX]

[DOI]

Electron. J. Comb., 2004

2003

Six New Constant Weight Binary Codes.

[BibT_eX]

Hui Kheng Aw

Ars Comb., 2003

2002

Uniform Group Divisible Designs with Block Sizes Three and n.

[BibT_eX]

[DOI]

Graphs Comb., 2002

2001

An improved finiteness theorem for graphical t-designs.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Asymptotically optimal erasure-resilient codes for large disk arrays.

[BibT_eX]

[DOI]

Charles J. Colbourn

Discret. Appl. Math., 2000

1997

Constructions for difference triangle sets.

[BibT_eX]

[DOI]

Charles J. Colbourn

IEEE Trans. Inf. Theory, 1997

1993

Single Jog Minimum Area Joining of Compacted Cells.

[BibT_eX]

[DOI]

Siu-Wing Cheng

Inf. Process. Lett., 1993

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

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

On Graphical Quintuple Systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 1992

The Algorithmic Complexity of Colour Switching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

A Complex Approach to the Security of Statistical Databases Subject to Off-line Sum Queries.

[BibT_eX]

Proceedings of the IT Security: The Need for International Cooperation, 1992

Performance driven placement with global routing for macro cells.

[BibT_eX]

[DOI]

Ching-Ting Wu

Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991

The 2-rotational Steiner triple systems of order 25.

[BibT_eX]

[DOI]

Gordon F. Royle

Discret. Math., 1991

Graphical t-designs with block sizes three and four.

[BibT_eX]

[DOI]

Discret. Math., 1991

The Cryptanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks.

[BibT_eX]

[DOI]