In this paper we consider the problem of encoding data into repeat-free sequences in which
sequences are imposed to contain any k-tuple at most once (for predefined k). First, the …

The Ising channel, which was introduced in 1990, is a channel with memory that models
intersymbol interference. In this paper, we consider the Ising channel with feedback and find the …

Cassuto and Blaum recently studied the symbol-pair channel, a model where every two
consecutive symbols are read together. This special channel structure is motivated by the …

In response to the evolving landscape of data storage, researchers have increasingly explored
non-traditional platforms, with DNA-based storage emerging as a cutting-edge solution. …

When transmitting information over a noisy channel, two approaches, dating back to
Shannon's work, are common: assuming the channel errors are independent of the transmitted …

In recent years, DNA has emerged as a potentially viable storage technology. DNA synthesis,
which refers to the task of writing the data into DNA, is perhaps the most costly part of …

Private information retrieval (PIR) codes and batch codes are two important types of codes
that are designed for coded distributed storage systems and private information retrieval …

Motivated by the established notion of storage codes, we consider sets of infinite sequences
over a finite alphabet such that every $k$ -tuple of consecutive entries is uniquely …

We introduce a dynamical model of node repair in distributed storage systems wherein the
storage nodes are subjected to failures according to independent Poisson processes. The …

Motivated by applications in polymer-based data storage, we study the problem of reconstructing
a string from part of its composition multiset. We give a full description of strings that …