Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms. - Yeow Meng Chee; Duc Tu Dao; Han Mao Kiah; San Ling; Hengjia Wei (SODA, 2019)

Maximum Length of Robust Positioning Sequences. - Duc Tu Dao; Han Mao Kiah; Hengjia Wei (ISIT, 2020)

Robust Positioning Patterns with Low Redundancy. - Yeow Meng Chee; Duc Tu Dao; Han Mao Kiah; San Ling; Hengjia Wei (SIAM J. Comput., 2020)

Regular Multiset Combinatorial Batch Codes over Vector Spaces. - Yeow Meng Chee; Duc Tu Dao; Tuvi Etzion; Han Mao Kiah; Hui Zhang 030 (ISIT, 2021)

Run Length Limited de Bruijn Sequences for Quantum Communications. - Yeow Meng Chee; Duc Tu Dao; Long Nguyen Tien; Duy Hoang Ta 001; Van Khu Vu (ISIT, 2022)

Average Redundancy of Variable-Length Balancing Schemes à la Knuth. - Duc Tu Dao; Han Mao Kiah; Tuan Thanh Nguyen (ISITA, 2022)

Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics. - Keshav Goyal; Duc Tu Dao; Han Mao Kiah; Mladen Kovacevic 001 (ISIT, 2023)

On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes. - Tuan Thanh Nguyen; Kui Cai 001; Han Mao Kiah; Duc Tu Dao; Kees A. Schouhamer Immink (ISIT, 2023)

Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics. - Kok Hao Chen; Duc Tu Dao; Han Mao Kiah; Van Long Phuoc Pham; Eitan Yaakobi (ISIT, 2024)

Gilbert-Varshamov Bound for Codes in L1 Metric using Multivariate Analytic Combinatorics. - Keshav Goyal; Duc Tu Dao; Mladen Kovacevic 001; Han Mao Kiah (CoRR, 2024)

Efficient Encoding of Binary Constant-Weight Codes: Variable-Length Balancing Schemes à La Knuth. - Duc Tu Dao; Han Mao Kiah; Tuan Thanh Nguyen (IEEE Trans. Inf. Theory, 2024)

Gilbert-Varshamov Bound for Codes in L₁ Metric Using Multivariate Analytic Combinatorics. - Keshav Goyal; Duc Tu Dao; Mladen Kovacevic 001; Han Mao Kiah (IEEE Trans. Inf. Theory, 2025)