English
Related papers

Related papers: Error-correcting Codes for Short Tandem Duplicatio…

200 papers

As DRAM scales in density and adopts 3D integration, raw fault rates increase and multi-bit errors are no longer rare. Such errors can severely impact Deep Neural Networks (DNNs): although DNNs tolerate small numerical perturbations, random…

Hardware Architecture · Computer Science 2026-05-07 Hanum Ko , Sangheum Yeon , Jong Hwan Ko , Jungrae Kim

In this paper, we study how often unique decoding from $t$ insertions or $t$ deletions occurs for error correcting codes. Insertions and deletions frequently occur in synchronization problems and DNA, a medium which is beginning to be used…

Information Theory · Computer Science 2017-09-29 Kayvon Mazooji

In this paper, we investigate the problem of designing $(n, N; \mathcal{B})$-reconstruction codes for $N\in \{14,11,9,5\}$, where $\mathcal{B}$ is the single-deletion single-substitution ball function that maps a sequence to the set of all…

Information Theory · Computer Science 2026-04-29 Yuling Li , Yubo Sun , Gennian Ge

We study segmented burst-deletion channels motivated by the observation that synchronization errors commonly occur in a bursty manner in real-world settings. In this channel model, transmitted sequences are implicitly divided into…

Information Theory · Computer Science 2025-07-21 Yajuan Liu , Tolga M. Duman

Motivated by the sequence reconstruction problem initiated by Levenshtein, reconstruction codes were introduced by Cai \emph{et al}. to combat errors when a fixed number of noisy channels are available. The central problem on this topic is…

Information Theory · Computer Science 2022-07-05 Rongsheng Wu , Xiande Zhang

Error-correcting codes over the real field are studied which can locate outlying computational errors when performing approximate computing of real vector--matrix multiplication on resistive crossbars. Prior work has concentrated on…

Information Theory · Computer Science 2024-02-22 Hengjia Wei , Ron M. Roth

We consider analog error-correcting codes (analog ECCs) that are designed to correct/detect outlying errors arising in analog implementations of vector-matrix multiplication. The error-correction/detection capability of an analog ECC can be…

Information Theory · Computer Science 2026-04-07 Wentu Song , Kui Cai

Best and Brouwer [Discrete Math. 17 (1977), 235-245] proved that triply-shortened and doubly-shortened binary Hamming codes (which have length $2^m-4$ and $2^m-3$, respectively) are optimal. Properties of such codes are here studied,…

Information Theory · Computer Science 2011-10-10 Denis S. Krotov , Patric R. J. Östergård , Olli Pottonen

We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes…

Information Theory · Computer Science 2015-02-23 Wael Halbawi , Matthew Thill , Babak Hassibi

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

Recently, network error correction coding (NEC) has been studied extensively. Several bounds in classical coding theory have been extended to network error correction coding, especially the Singleton bound. In this paper, following the…

Information Theory · Computer Science 2010-11-08 Xuan Guang , Fang-Wei Fu , Zhen Zhang

We introduce a two-step error correction scheme for reconciliation in continuous-variable quantum key distribution systems. Using this scheme, it is possible to use error correction codes with small blocklengths (1000 bits), increasing…

In this paper, we introduce a reconciliation protocol with a two-step error correction scheme that uses a short-blocklength, low-rate code and a long-blocklength, high-rate code. We simulate the protocol using a short-block-length…

Quantum computers hold the potential to surpass classical computers in solving complex computational problems. However, the fragility of quantum information and the error-prone nature of quantum operations make building large-scale,…

This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable…

Information Theory · Computer Science 2013-12-12 Natalia Silberstein , Ankit Singh Rawat , Sriram Vishwanath

Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead…

Quantum Physics · Physics 2026-05-13 Chen Zhao , Casey Duckering , Andi Gu , Nishad Maskara , Hengyun Zhou

Erasure correcting codes are widely used to ensure data persistence in distributed storage systems. This paper addresses the simultaneous repair of multiple failures in such codes. We go beyond existing work (i.e., regenerating codes by…

Information Theory · Computer Science 2013-09-18 Anne-Marie Kermarrec , Gilles Straub , Nicolas Le Scouarnec

DNA emerges as a promising medium for the exponential growth of digital data due to its density and durability. This study extends recent research by addressing the \emph{coverage depth problem} in practical scenarios, exploring optimal…

Information Theory · Computer Science 2024-02-01 Hadas Abraham , Rayn Gabrys , Eitan Yaakobi

Text error correction aims to correct the errors in text sequences such as those typed by humans or generated by speech recognition models. Previous error correction methods usually take the source (incorrect) sentence as encoder input and…

Computation and Language · Computer Science 2022-11-28 Kai Shen , Yichong Leng , Xu Tan , Siliang Tang , Yuan Zhang , Wenjie Liu , Edward Lin

A new method to identify all sufficiently long repeating substrings in one or several symbol sequences is proposed. The method is based on a specific gauge applied to symbol sequences that guarantees identification of the repeating…

Genomics · Quantitative Biology 2016-04-07 Sergey Tsarev , Michael Sadovsky