Yubo Sun

Single-Fragment Forensic Coding via Multidimensional Cyclically Permutable Codes

Yubo Sun, Yijun Zhang, Gennian Ge

The proliferation of 3D printing raises new security and forensic challenges, including the risk of unauthorized fabrication of untraceable firearms and other regulated items. To e…

Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse $3$ -Uniform Hypergraphs

Xuejiao Han, Yubo Sun, Gennian Ge

A ternary code is \emph{trifferent} if every three distinct codewords have a coordinate in which their symbols are pairwise distinct. Let $T (n)$ be the maximum size of a trifferent…

math.CO2026

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 $q$ -ary alphabet. Let $Σ_{q}^{n}$ 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 $(n, N; B)$ -reconstruction codes for $N \in {14, 11, 9, 5}$ , where $B$ 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 $k$ is the insertion of the reversed and co…

Reconstruction Codes for Deletions and Insertions: Connection, Distinction, and Construction

Yubo Sun, Gennian Ge

Let $B (\cdot)$ be an error ball function. A set of $q$ -ary sequences of length $n$ is referred to as an \emph{ $(n, q, N; B)$ -reconstruction code} if each sequence…

Correcting Bursty/Localized Deletions: A New Error-Position-Estimation Code

Zuo Ye, Yubo Sun, Gennian Ge

Codes correcting bursts of deletions and localized deletions have garnered significant research interest in recent years. One of the primary objectives is to construct codes with m…

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels

Wenjun Yu, Yubo Sun, Zixiang Xu +2

We study optimal reconstruction codes over the multiple-burst substitution channel. Our main contribution is establishing a trade-off between the error-correction capability of the…

On the Fixed-Length-Burst Levenshtein Ball with Unit Radius

Yuanxiao Xi, Yubo Sun, Gennian Ge

Consider a length- $n$ sequence $x$ over a $q$ -ary alphabet. The \emph{fixed-length Levenshtein ball} $L_{t} (x)$ of radius $t$ encompasses all length- $n$ $q$ -ary s…

Correcting Errors Through Partitioning and Burst-Deletion Correction

Yubo Sun, Gennian Ge

In this paper, we propose a partitioning technique that decomposes a pair of sequences with overlapping $t$ -deletion $s$ -substitution balls into sub-pairs, where the $^{\leq} t$ -bur…

Criss-Cross Deletion Correcting Codes: Optimal Constructions with Efficient Decoders

Yubo Sun, Gennian Ge

This paper addresses fundamental challenges in two-dimensional error correction by constructing optimal codes for \emph{criss-cross deletions}. We consider an $n \times n$ array…

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…

Sequence Reconstruction under Channels with Multiple Bursts of Insertions or Deletions

Zhaojun Lan, Yubo Sun, Wenjun Yu +1

The sequence reconstruction problem involves a model where a sequence is transmitted over several identical channels. This model investigates the minimum number of channels require…

Codes Correcting Two Bursts of Exactly $b$ Deletions

Zuo Ye, Yubo Sun, Wenjun Yu +2

In this paper, we investigate codes designed to correct two bursts of deletions, where each burst has a length of exactly $b$ , where $b > 1$ . The previous best construction, achieved…

Bounds and Constructions of $ℓ$ -Read Codes under the Hamming Metric

Yubo Sun, Gennian Ge

Nanopore sequencing is a promising technology for DNA sequencing. In this paper, we investigate a specific model of the nanopore sequencer, which takes a $q$ -ary sequence of length…

Binary Codes for Correcting Two Edits

Yubo Sun, Gennian Ge

An edit refers to a single insertion, deletion, or substitution. This paper aims to construct binary codes that can correct two edits. To do this, a necessary and sufficient condit…