Repeat-Free Codes

09/12/2019
by   Ohad Elishco, et al.
0

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 capacity and redundancy of the repeat-free constraint are calculated. Then, an efficient algorithm, which uses a single bit of redundancy, is presented to encode length-n sequences for k=2+2log (n). This algorithm is then improved to support any value of k of the form k=alog (n), for 1<a, while its redundancy is o(n). We also calculate the capacity of repeat-free sequences when combined with local constraints which are given by a constrained system, and the capacity of multi-dimensional repeat-free codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2023

Codes Correcting a Single Long Duplication Error

We consider the problem of constructing a code capable of correcting a s...
research
01/12/2023

Redundancy of Codes with Graph Constraints

In this paper, we study the redundancy of linear codes with graph constr...
research
01/10/2019

The Capacity of Count-Constrained ICI-Free Systems

A Markov chain approach is applied to determine the capacity of a genera...
research
01/16/2019

Deep Holes of Projective Reed-Solomon Codes

Projective Reed-Solomon (PRS) codes are Reed-Solomon codes of the maximu...
research
01/31/2021

The Zero Cubes Free and Cubes Unique Multidimensional Constraints

This paper studies two families of constraints for two-dimensional and m...
research
07/29/2021

A New Lossless Data Compression Algorithm Exploiting Positional Redundancy

A new run length encoding algorithm for lossless data compression that e...

Please sign up or login with your details

Forgot password? Click here to reset