activity
20102026
most citedRepairing Reed-Solomon Codes With Multiple Erasures

98 citations · 219 across the 62 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.IT2019★ 1 cited

Robust Positioning Patterns with Low Redundancy

Yeow Meng Chee, Duc Tu Dao, Han Mao Kiah +2

A robust positioning pattern is a large array that allows a mobile device to locate its position by reading a possibly corrupted small window around it. In this paper, we provide c…

cs.CR2019

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

Yeow Meng Chee, Johan Chrisnata, Tuvi Etzion +1

The linear complexity of a sequence is one of the measures of its predictability. It represents the smallest degree of a linear recursion which the sequence satisfies. There ar…

cs.IT2019★ 19 cited

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

Kui Cai, Yeow Meng Chee, Ryan Gabrys +2

An indel refers to a single insertion or deletion, while an edit refers to a single insertion, deletion or substitution. In this paper, we investigate codes that combat either a si…

cs.IT2019

Proceedings of the 11th Asia-Europe Workshop on Concepts in Information Theory

A. J. Han Vinck, Kees A. Schouhamer Immink, Tadashi Wadayama +24

This year, 2019 we celebrate 30 years of our friendship between Asian and European scientists at the AEW11 in Rotterdam, the Netherlands. Many of the 1989 participants are also pre…

cs.IT2019

Generalized Sphere-Packing Bound for Subblock-Constrained Codes

Han Mao Kiah, Anshoo Tandon, Mehul Motani

We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the numbe…