On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric

06/16/2022
by   Daniella Bar-Lev, et al.
0

The rapid development of DNA storage has brought the deletion and insertion channel to the front line of research. When the number of deletions is equal to the number of insertions, the Fixed Length Levenshtein (FLL) metric is the right measure for the distance between two words of the same length. Similar to any other metric, the size of a ball is one of the most fundamental parameters. In this work, we consider the minimum, maximum, and average size of a ball with radius one, in the FLL metric. The related minimum and the maximum size of a maximal anticode with diameter one are also considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/02/2021

On the Size of Levenshtein Balls

The rapid development of DNA storage has brought the deletion and insert...
research
04/05/2022

On the size distribution of Levenshtein balls with radius one

The fixed length Levenshtein (FLL) distance between two words 𝐱,𝐲∈ℤ_m^n ...
research
07/24/2018

On critical and maximal digraphs

This paper is devoted to the study of directed graphs with extremal prop...
research
09/23/2022

Logarithmically larger deletion codes of all distances

The deletion distance between two binary words u,v ∈{0,1}^n is the small...
research
11/30/2022

A family of diameter perfect constant-weight codes from Steiner systems

If S is a transitive metric space, then |C|·|A| ≤ |S| for any distance-d...
research
06/26/2020

Cutting Polygons into Small Pieces with Chords: Laser-Based Localization

Motivated by indoor localization by tripwire lasers, we study the proble...
research
03/21/2020

Hidden Words Statistics for Large Patterns

We study here the so called subsequence pattern matching also known as h...

Please sign up or login with your details

Forgot password? Click here to reset