7 papers
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…
On the weighted hard-core model and Rado's covering problem for congruent Euclidean balls
Chengfei Xie, Gennian Ge
Let be a symmetric convex body in and let denote the largest constant such that every finite collection of translates of contains a pairwise disjo…
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…
Linear Network Coding for Robust Function Computation and Its Applications in Distributed Computing
Hengjia Wei, Min Xu, Gennian Ge
We investigate linear network coding in the context of robust function computation, where a sink node is tasked with computing a target function of messages generated at multiple s…
Codes Correcting Two Bursts of Exactly 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 , where . The previous best construction, achieved…
Reconstruction from Noisy Substrings
Hengjia Wei, Moshe Schwartz, Gennian Ge
This paper studies the problem of encoding messages into sequences which can be uniquely recovered from some noisy observations about their substrings. The observed reads comprise…