Explicit Good Codes Approaching Distance 1 in Ulam Metric

Elazar Goldenberg, Mursalin Habib, Karthik C. S

The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\epsilon >0$, there exists some…