From the 1 of 16 linked papers with an AI index.
16 papers
Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse -Uniform Hypergraphs
Xuejiao Han, Yubo Sun, Gennian Ge
The paper improves the known lower bound on the size of ternary trifferent codes by a factor of √n, using a refined concatenation method that employs locally sparse 3‑uniform hyper…
Extremal Deletion-Ball Intersections under Run-Count and Lower-Order Deletion-Ball Intersection Constraints
Yubo Sun, Gennian Ge
Motivated by sequence reconstruction and reconstruction codes, we study extremal intersections of deletion balls over a fixed -ary alphabet. Let be the set of sequences…
Random Reed--Solomon Codes Correcting Permutations, Insertions, and Deletions over Polynomial-Size Alphabets
Yijun Zhang, Yubo Sun, Xiande Zhang +1
We study Reed--Solomon codes against adversarial coordinate permutations followed by insertion-deletion (insdel) errors. It was previously shown by Con (2025) that Reed--Solomon co…
New bounds for covering codes under insertions or deletions
Chengfei Xie, Yubo Sun, Gennian Ge
Covering codes for insertions and deletions arise naturally in the study of synchronization errors and differ substantially from their classical counterparts in the Hamming metric.…
Correcting One Deletion and One Substitution with a Constant Number of Reads
Yuling Li, Yubo Sun, Gennian Ge
In this paper, we investigate the problem of designing -reconstruction codes for , where is the single-deletion single-substi…
On the Palindromic/Reverse-Complement Duplication Correcting Codes
Yubo Sun, Gennian Ge
Motivated by applications in in-vivo DNA storage, we study codes for correcting duplications. A reverse-complement duplication of length is the insertion of the reversed and co…