# On the Size of Levenshtein Balls

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

## Authors

• 3 publications
• 13 publications
• 41 publications
07/24/2018

### On critical and maximal digraphs

This paper is devoted to the study of directed graphs with extremal prop...
01/06/2020

### Codes over Trees

In graph theory, a tree is one of the more popular families of graphs wi...
10/09/2018

### Explicit optimal-length locally repairable codes of distance 5

Locally repairable codes (LRCs) have received significant recent attenti...
02/10/2021

### Trace Reconstruction with Bounded Edit Distance

The trace reconstruction problem studies the number of noisy samples nee...
07/02/2019

### On the list decodability of Rank Metric codes

Let $k,n,m \in \mathbb{Z}^+$ integers such that $k\leq n \leq m$, let \$\...
12/14/2020

### Lagrangian Reachtubes: The Next Generation

We introduce LRT-NG, a set of techniques and an associated toolset that ...
02/29/2020

### Imposing minimum and maximum member size, minimum cavity size, and minimum separation distance between solid members in topology optimization

This paper focuses on density-based topology optimization and proposes a...
##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.