98 citations · 219 across the 62 of their papers we have counts for
6 papers · 1 filter
Repairing Reed-Solomon Codes via Subspace Polynomials
Hoang Dau, Dinh Thi Xinh, Han Mao Kiah +2
We propose new repair schemes for Reed-Solomon codes that use subspace polynomials and hence generalize previous works in the literature that employ trace polynomials. The Reed-Sol…
Explicit Baranyai Partitions for Quadruples, Part I: Quadrupling Constructions
Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah +2
It is well known that, whenever divides , the complete -uniform hypergraph on vertices can be partitioned into disjoint perfect matchings. Equivalently, the set of $k…
Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications
Yeow Meng Chee, Tuvi Etzion, Han Mao Kiah +3
The de Bruijn graph, its sequences, and their various generalizations, have found many applications in information theory, including many new ones in the last decade. In this paper…
Optimal Reconstruction Codes for Deletion Channels
Johan Chrisnata, Han Mao Kiah, Eitan Yaakobi
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…
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…