English
Related papers

Related papers: Coding for Synthesis Defects

200 papers

In this paper, we study achievable rates of concatenated coding schemes over a deoxyribonucleic acid (DNA) storage channel. Our channel model incorporates the main features of DNA-based data storage. First, information is stored on many,…

Information Theory · Computer Science 2020-05-04 Andreas Lenz , Lorenz Welter , Sven Puchinger

Encoding data as a set of unordered strings is receiving great attention as it captures one of the basic features of DNA storage systems. However, the challenge of constructing optimal redundancy codes for this channel remained elusive. In…

Information Theory · Computer Science 2023-08-16 Jin Sima , Netanel Raviv , Jehoshua Bruck

DNA Data storage has recently attracted much attention due to its durable preservation and extremely high information density (bits per gram) properties. In this work, we propose a hybrid coding strategy comprising of generalized…

Information Theory · Computer Science 2021-12-20 Yixin Wang , Li Deng , Md. Noor-A-Rahim , Erry Gunawan , Yong L. Guan , Zhi P. Shi , Chueh L. Poh

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 consecutive substrings with some given minimum overlap. This…

Information Theory · Computer Science 2023-12-11 Hengjia Wei , Moshe Schwartz , Gennian Ge

In a DNA sequence, we have the celebrated Watson-Crick complement $\overline{T}=A$, $\overline{A}=T$, $\overline{C}=G$, and $\overline{G}=C$. Given an integer $m\ge 2$, a secondary structure in a DNA sequence refers to the existence of two…

Information Theory · Computer Science 2023-04-25 Hui Chu , Chen Wang , Yiwei Zhang

In this work, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log n + O(log log n) bits of redundancy, where n is the length…

Information Theory · Computer Science 2018-05-02 Ryan Gabrys , Frederic Sala

Self-synchronization under the presence of additive noise can be achieved by allocating a certain number of bits of each codeword as markers for synchronization. Difference systems of sets are combinatorial designs which specify the…

Information Theory · Computer Science 2013-03-19 Yuichiro Fujiwara , Vladimir D. Tonchev

We consider the problem of constructing a code capable of correcting a single long tandem duplication error of variable length. As the main contribution of this paper, we present a $q$-ary efficiently encodable code of length $n+1$ and…

Information Theory · Computer Science 2023-04-26 Daniil Goshkoder , Nikita Polyanskii , Ilya Vorobyev

Field Programmable Gate Array (FPGA) logic synthesis compilers (e.g., Vivado, Iverilog, Yosys, and Quartus) are widely applied in Electronic Design Automation (EDA), such as the development of FPGA programs.However, defects (i.e., incorrect…

Hardware Architecture · Computer Science 2024-07-18 Zhihao Xu , Shikai Guo , Guilin Zhao , Peiyu Zou , Xiaochen Li , He Jiang

Formal methods apply algorithms based on mathematical principles to enhance the reliability of systems. It would only be natural to try to progress from verification, model checking or testing a system against its formal specification into…

Software Engineering · Computer Science 2014-02-28 Gal Katz , Doron Peled

We propose a novel coding scheme for DNA-based storage systems, called the shift-interleave (SI) coding, designed to correct insertion, deletion, and substitution (IDS) errors, as well as sequence losses. The SI coding scheme employs…

Information Theory · Computer Science 2024-01-29 Ryo Shibata , Haruhiko Kaneko

Due to the lack of parallel data in current Grammatical Error Correction (GEC) task, models based on Sequence to Sequence framework cannot be adequately trained to obtain higher performance. We propose two data synthesis methods which can…

Computation and Language · Computer Science 2021-12-28 Liner Yang , Chencheng Wang , Yun Chen , Yongping Du , Erhong Yang

Motivated by applications to DNA-storage, flash memory, and magnetic recording, we study perfect burst-correcting codes for the limited-magnitude error channel. These codes are lattices that tile the integer grid with the appropriate error…

Information Theory · Computer Science 2022-01-06 Hengjia Wei , Moshe Schwartz

An RNA sequence is a word over an alphabet on four elements $\{A,C,G,U\}$ called bases. RNA sequences fold into secondary structures where some bases match one another while others remain unpaired. Pseudoknot-free secondary structures can…

Data Structures and Algorithms · Computer Science 2018-03-28 Édouard Bonnet , Paweł Rzążewski , Florian Sikora

To ensure resilience against the unavoidable noise in quantum computers, quantum information needs to be encoded using an error-correcting code, and circuits must have a particular structure to be fault-tolerant. Compilation of…

Quantum Physics · Physics 2025-01-13 Ludwig Schmid , Tom Peham , Lucas Berent , Markus Müller , Robert Wille

DNA-synthesis providers screen incoming orders by searching the requested sequence against curated hazard lists. We show that this baseline collapses to a 100% false-flag rate when the hazardous sequence comes from a taxonomic family absent…

Genomics · Quantitative Biology 2026-05-04 Najmul Hasan

DNA storage systems face significant challenges, including insertion, deletion, and substitution (IDS) errors. Therefore, designing effective synchronization codes, i.e., codes capable of correcting IDS errors, is essential for DNA storage…

Information Theory · Computer Science 2025-05-23 Javad Haghighat , Tolga M. Duman

DNA-based storage is an emerging storage technology that provides high information density and long duration. Due to the physical constraints in the reading and writing processes, error correction in DNA storage poses several interesting…

Information Theory · Computer Science 2023-10-04 Jin Sima , Netanel Raviv , Moshe Schwartz , Jehoshua Bruck

Sequence generation applications require satisfying semantic constraints, such as ensuring that programs are correct, using certain keywords, or avoiding undesirable content. Language models, whether fine-tuned or prompted with few-shot…

Computation and Language · Computer Science 2022-11-02 Sean Welleck , Ximing Lu , Peter West , Faeze Brahman , Tianxiao Shen , Daniel Khashabi , Yejin Choi

Recent work by Smagloy et al. (ISIT 2020) shows that the redundancy of a single-deletion $s$-substitution correcting code is asymptotically at least $(s+1)\log n+o(\log n)$, where $n$ is the length of the codes. They also provide a…

Information Theory · Computer Science 2020-11-24 Wentu Song , Nikita Polyanskii , Kui Cai , Xuan He
‹ Prev 1 3 4 5 6 7 10 Next ›