Gennian Ge

collaborators

4 papers

math.MG2026

On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls

Chengfei Xie, Gennian Ge

Let $B^{d}$ denote the Euclidean unit ball in $R^{d}$ and $f (B^{d})$ denote the largest constant $c$ such that every finite collection of congruent Euclidean balls contains a pa…

cs.IT2026

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.…

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 $(n, N; B)$ -reconstruction codes for $N \in {14, 11, 9, 5}$ , where $B$ is the single-deletion single-substi…

cs.IT2025

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…

On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls

New bounds for covering codes under insertions or deletions

Correcting One Deletion and One Substitution with a Constant Number of Reads

Codes Correcting Two Bursts of Exactly b Deletions

Codes Correcting Two Bursts of Exactly $b$ Deletions