New answers tagged

1 vote

How an insertion can be decoded in Varshamov and Tenengolts (VT) codes

It's provable that any $e$-deletion code is usable as an $e$-insertion code, but the proof is nonconstructive and doesn't necessarily give you an efficient decoding process would work. (There is a ...
user avatar
  • 233

Top 50 recent answers are included