ML p(r)ior | Weakly Mutually Uncorrelated Codes

Weakly Mutually Uncorrelated Codes

2016-01-29
We introduce the notion of weakly mutually uncorrelated (WMU) sequences, motivated by applications in DNA-based storage systems and synchronization protocols. WMU sequences are characterized by the property that no sufficiently long suffix of one sequence is the prefix of the same or another sequence. In addition, WMU sequences used in DNA-based storage systems are required to have balanced compositions of symbols and to be at large mutual Hamming distance from each other. We present a number of constructions for balanced, error-correcting WMU codes using Dyck paths, Knuth's balancing principle, prefix synchronized and cyclic codes.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2018-06-07
1806.02607 | cs.IT

In this paper we propose a simple method for generating short-length rate-compatible codes over $\ma… show more
PDF

Highlights - Most important sentences from the article

2019-02-12

DNA storage has emerged as an important area of research. The reliability of DNA storage system depe… show more
PDF

Highlights - Most important sentences from the article

2019-01-23
1901.07769 | cs.IT

In this paper, two moment balancing schemes, namely a variable index scheme and a fixed index scheme… show more
PDF

Highlights - Most important sentences from the article

2019-01-25
1901.08858 | cs.IT

In this paper we prove new lower bounds for the maximal size of permutation codes by connecting the … show more
PDF

Highlights - Most important sentences from the article

2018-01-08
1801.02329 | cs.IT

Grassmannian codes are known to be useful in error-correction for random network coding. Recently, t… show more
PDF

Highlights - Most important sentences from the article

2018-05-16
1805.06091 | cs.IT

List decoding of insertions and deletions is studied. A Johnson-type upper bound on the maximum list… show more
PDF

Highlights - Most important sentences from the article

2018-08-16

A class of low-power cooling (LPC) codes, to control simultaneously both the peak temperature and th… show more
PDF

Highlights - Most important sentences from the article

2019-03-13

The component-wise or Schur product $C*C'$ of two linear error correcting codes $C$ and $C'$ over ce… show more
PDF

Highlights - Most important sentences from the article

2018-11-22
1811.09142 | cs.IT

Recently, it was discovered by several authors that a $q$-ary optimal locally recoverable code, i.e.… show more
PDF

Highlights - Most important sentences from the article

2017-01-21

A binary matrix is called an s-separable code for the disjunctive multiple-access channel (disj-MAC)… show more
PDF

Highlights - Most important sentences from the article

2019-01-04

To equip DNA-based data storage with random-access capabilities, Yazdi et al. (2018) prepended DNA s… show more
PDF

Highlights - Most important sentences from the article

2018-09-16
1809.05821 | cs.IT

The process of DNA-based data storage (DNA storage for short) can be mathematically modelled as a co… show more
PDF

Highlights - Most important sentences from the article

2018-08-30

A (tandem) duplication of length $ k $ is an insertion of an exact copy of a substring of length $ k… show more
PDF

Highlights - Most important sentences from the article

2018-12-14
1812.06798 | cs.IT

We describe properties and constructions of constraint-based codes for DNA-based data storage which … show more
PDF

Highlights - Most important sentences from the article

2018-08-14
1808.04558 | cs.IT

It was shown in \cite{GXY18} that the length $n$ of a $q$-ary linear locally recoverable code with d… show more
PDF

Highlights - Most important sentences from the article

2017-03-03
1703.01267 | cs.IT

The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the componen… show more
PDF

Highlights - Most important sentences from the article