3 papers
cs.IT2026
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…
cs.IT2026
Bounds and Constructions of Codes for Ordered Composite DNA Sequences
Zuo Ye, Yuling Li, Zhaojun Lan +1
This paper extends the foundational work of Dollma \emph{et al}. on codes for ordered composite DNA sequences. We consider the general setting with an alphabet of size and a re…
cs.IT2025
Binary Reconstruction Codes for Correcting One Deletion and One Substitution
Yuling Li, Yubo Sun, Gennian Ge
In this paper, we investigate binary reconstruction codes capable of correcting one deletion and one substitution. We define the \emph{single-deletion single-substitution ball} fun…