Minimum Synthesis Time for Single-Deletion Correcting Codes of Prescribed Size
Yuling Li, Wenjun Yu, Gennian Ge
Abstract
DNA is a promising medium for data storage, but the high cost of DNA synthesis remains a major obstacle to its widespread deployment. In the reference-based synthesis model, synthesis time is measured by the length of the reference sequence. Previous studies have analyzed code sizes under synthesis-time constraints and constructed cost-constrained codes, including codes that correct deletions. In this paper, we study the minimum synthesis time for codes of prescribed size, considering both unrestricted codes and single-deletion correcting codes. We establish finite-length lower bounds valid for arbitrary reference sequences and upper bounds using existing q-ary differential VT codes. For fixed q≥3, A>0, and R∈(0,1), we determine the minimum synthesis time up to an O(1) term when the code size is Mn= AqRn. The corresponding redundancy is (1-R)n2q-2A+o(1) bits. In particular, for these code sizes, the minimum synthesis time for single-deletion correcting codes exceeds that for unrestricted codes by a term proportional to n, and we determine its coefficient. We also derive upper and lower bounds for code sizes qn/(nqsn), where sn∞ and sn=o(n). These sizes correspond to redundancy 2 n+sn2q+o(1) bits. For code sizes qn/(nqc) with fixed constant c, the redundancy is 2 n+c2q+o(1) bits. We give conditions under which single-deletion correcting codes exist or do not exist for all sufficiently large n, together with bounds on the minimum synthesis time. These results show how code size and the single-deletion correcting constraint affect synthesis time and provide theoretical guidance for the construction of cost-constrained codes.
Create a lesson
Related papers
Optimal Preemption: Guaranteeing Information Freshness in Mean Age and Beyond
Aimin Li, Yiğit İnce, Elif Uysal
Spherical Tessellation of Circular Arrays for Massive MIMO: Favourable Propagation Conditions and Spectral Design
Geili T A El Sanousi, Tuan Anh Le, Raed A A Abd-Alhameed et al.
Physics-Informed Deep Learning for Channel Prediction in Satellite-Mounted Metasurface Reflection Communication Networks
Aolin Sun, Ruihong Jiang, Jincong Mo et al.
Two-Timescale Channel Estimation and Port Selection for Fluid Antenna Systems With Limited Port Observations
Xusheng Zhu, Kai-Kit Wong, Jiajian Wang et al.
Asymptotic Bounds for Codes in Toroidal Distance
Pengjie Zhong, Jinquan Luo
Feedback-Free FDD Cell-Free Massive MIMO With Sparse AP Activation and Dual-Mode Precoding
Wei Jiang, Hans Dieter Schotten