ref - insdel

codes/classical/q-ary_digits/alternative_metrics/insertion_deletion/insertion_deletion.yml

@@ -23,6 +23,9 @@ protection: |
     Similar distances, collectively called \textit{editing distances}, can be defined for insertions and related operations \cite[Sec. 22.7]{preset:HKSmetrics}.
 
 
+features:
+  rate: 'An asymptotically good linear code against bit-flip errors can be converted into an asymptotically good code against insertion-deletion errors \cite{arxiv:2007.09075}.'
+
 # features:
 #   rate: 'For binary codes, the optimal achievable rate to protect against a \(\delta\) fraction of insertions and deletions is \(1- O(\delta \log\frac{1}{\delta})\).'
 # In the large alphabet setting, there exists a code which corrects a \(\delta\) fraction of insertions and deletions and has a rate of \((1-\Omega)^5\).'