activity
20072026
most citedStrongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes

295 citations · 710 across the 81 of their papers we have counts for

collaborators
Showing cs.ITShow all

47 papers · 1 filter

cs.IT2025

Sequence Reconstruction for Sticky Insertion/Deletion Channels

Van Long Phuoc Pham, Yeow Meng Chee, Kui Cai +1

The sequence reconstruction problem for insertion/deletion channels has attracted significant attention owing to their applications recently in some emerging data storage systems,…

cs.IT2025

On de Bruijn Array Codes Part II: Linear Codes

Simon Blackburn, Yeow Meng Chee, Tuvi Etzion +1

An M-sequence generated by a primitive polynomial has many interesting and desirable properties. A pseudo-random array is the two-dimensional generalization of an M-sequence. There…

cs.IT2024

Permutation and Multi-permutation Codes Correcting Multiple Deletions

Shuche Wang, The Nguyen, Yeow Meng Chee +1

Permutation codes in the Ulam metric, which can correct multiple deletions, have been investigated extensively recently. In this work, we are interested in the maximum size of perm…

cs.IT2024

Repairing Reed-Solomon Codes with Side Information

Thi Xinh Dinh, Ba Thong Le, Son Hoang Dau +6

We generalize the problem of recovering a lost/erased symbol in a Reed-Solomon code to the scenario in which some side information about the lost symbol is known. The side informat…

cs.IT2024

Efficient designs for threshold group testing without gap

Thach V. Bui, Yeow Meng Chee, Van Khu Vu

Given defective items in a population of items with , in threshold group testing without gap, the outcome of a test on a subset of items is positive if the subset…

cs.IT2024

On de Bruijn Covering Sequences and Arrays

Yeow Meng Chee, Tuvi Etzion, Hoang Ta +1

An -de Bruijn covering array (dBCA) is a doubly periodic array over an alphabet of size such that the set of all its windows form a covering…