Anchor-Based Correction of Substitutions in Indexed Sets

01/21/2019
by   Andreas Lenz, et al.
0

Motivated by DNA-based data storage, we investigate a system where digital information is stored in an unordered set of several vectors over a finite alphabet. Each vector begins with a unique index that represents its position in the whole data set and does not contain data. This paper deals with the design of error-correcting codes for such indexed sets in the presence of substitution errors. We propose a construction that efficiently deals with the challenges that arise when designing codes for unordered sets. Using a novel mechanism, called anchoring, we show that it is possible to combat the ordering loss of sequences with only a small amount of redundancy, which allows to use standard coding techniques, such as tensor-product codes to correct errors within the sequences. We finally derive upper and lower bounds on the achievable redundancy of codes within the considered channel model and verify that our construction yields a redundancy that is close to the best possible achievable one. Our results surprisingly indicate that it requires less redundancy to correct errors in the indices than in the data part of vectors.

READ FULL TEXT
research
01/15/2018

Coding over Sets for DNA Storage

In this paper we study error-correcting codes for the storage of data in...
research
03/11/2019

Clustering-Correcting Codes

A new family of codes, called clustering-correcting codes, is presented ...
research
02/20/2023

Reconstruction of Sequences Distorted by Two Insertions

Reconstruction codes are generalizations of error-correcting codes that ...
research
09/18/2020

Improved Coding over Sets for DNA-Based Data Storage

Error-correcting codes over sets, with applications to DNA storage, are ...
research
02/05/2021

Function-Correcting Codes

Motivated by applications in machine learning and archival data storage,...
research
08/15/2023

Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions

Encoding data as a set of unordered strings is receiving great attention...
research
01/18/2020

Optimal Codes Correcting a Burst of Deletions of Variable Length

In this paper, we present an efficiently encodable and decodable code co...

Please sign up or login with your details

Forgot password? Click here to reset