Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the List Decodability of Insertions and Deletions   In this work, we study the problem of list decoding of insertions and
deletions. We present a Johnson-type upper bound on the maximum list size. The
bound is meaningful only when insertions occur. Our bound implies that there
are binary codes of rate $\Omega(1)$ that are list-decodable from a
$0.707$-fraction of insertions. For any $\tau_\mathsf{I} \geq 0$ and
$\tau_\mathsf{D} \in [0,1)$, there exist $q$-ary codes of rate $\Omega(1)$ that
are list-decodable from a $\tau_\mathsf{I}$-fraction of insertions and
$\tau_\mathsf{D}$-fraction of deletions, where $q$ depends only on
$\tau_\mathsf{I}$ and $\tau_\mathsf{D}$. We also provide efficient encoding and
decoding algorithms for list-decoding from $\tau_\mathsf{I}$-fraction of
insertions and $\tau_\mathsf{D}$-fraction of deletions for any $\tau_\mathsf{I}
\geq 0$ and $\tau_\mathsf{D} \in [0,1)$. Based on the Johnson-type bound, we
derive a Plotkin-type upper bound on the code size in the Levenshtein metric.

25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
5
The categories of this paper are: gr-qc
26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
30
The categories of this paper are: q-alg
37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
36
The categories of this paper are: cmp-lg
9
The categories of this paper are: nlin
15
The categories of this paper are: nucl-ex