19 citations · 41 across the 15 of their papers we have counts for
15 papers
From One-Dimensional Codes to Two-Dimensional Codes: A Universal Framework for the Bounded-Weight Constraint
Viet Hai Le, Thanh Phong Pham, Tuan Thanh Nguyen +2
Recent developments in storage -- especially in the area of resistive random access memory (ReRAM) -- are attempting to scale the storage density by regarding the information data…
Constrained Coding for Composite DNA: Channel Capacity and Efficient Constructions
Tuan Thanh Nguyen, Chen Wang, Kui Cai +2
Composite DNA is a recent novel method to increase the information capacity of DNA-based data storage above the theoretical limit of 2 bits/symbol. In this method, every composite…
High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes
Yi Ding, Xuan He, Tuan Thanh Nguyen +6
DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional d…
A New Version of q-ary Varshamov-Tenengolts Codes with More Efficient Encoders: The Differential VT Codes and The Differential Shifted VT Codes
Tuan Thanh Nguyen, Kui Cai, Paul H. Siegel
The problem of correcting deletions and insertions has recently received significantly increased attention due to the DNA-based data storage technology, which suffers from deletion…
On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes
Tuan Thanh Nguyen, Kui Cai, Han Mao Kiah +2
In this work, we investigate a challenging problem, which has been considered to be an important criterion in designing codewords for DNA computing purposes, namely secondary struc…
Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder
Tuan Thanh Nguyen, Kui Cai, Paul H. Siegel
In this work, we present a new version of non-binary VT codes that are capable of correcting a single deletion or single insertion. Moreover, we provide the first known linear time…
Two dimensional RC/Subarray Constrained Codes: Bounded Weight and Almost Balanced Weight
Tuan Thanh Nguyen, Kui Cai, Han Mao Kiah +2
In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given , we study (i) The -bounded constraint: a binary vector of size …
Average Redundancy of Variable-Length Balancing Schemes à la Knuth
Duc Tu Dao, Han Mao Kiah, Tuan Thanh Nguyen
We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the avera…
List-decodable Codes for Single-deletion Single-substitution with List-size Two
Wentu Song, Kui Cai, Tuan Thanh Nguyen
In this paper, we present an explicit construction of list-decodable codes for single-deletion and single-substitution with list size two and redundancy 3log n+4, where n is the bl…
Efficient Design of Subblock Energy-Constrained Codes and Sliding Window-Constrained Codes
Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink
The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems suc…
Capacity-Approaching Constrained Codes with Error Correction for DNA-Based Data Storage
Tuan Thanh Nguyen, Kui Cai, Kees A. Schouhamer Immink +1
We propose coding techniques that limit the length of homopolymers runs, ensure the GC-content constraint, and are capable of correcting a single edit error in strands of nucleotid…
Coding for Sequence Reconstruction for Single Edits
Kui Cai, Han Mao Kiah, Tuan Thanh Nguyen +1
The sequence reconstruction problem, introduced by Levenshtein in 2001, considers a communication scenario where the sender transmits a codeword from some codebook and the receiver…
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…
Efficient Encoding/Decoding of Irreducible Words for Codes Correcting Tandem Duplications
Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah +1
Tandem duplication is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, Jain et…
Deciding the Confusability of Words under Tandem Repeats
Yeow Meng Chee, Johan Chrisnata, Han Mao Kiah +1
Tandem duplication in DNA is the process of inserting a copy of a segment of DNA adjacent to the original position. Motivated by applications that store data in living organisms, J…