Codes Correcting a Burst of Deletions or Insertions

1 code implementation • 22 Feb 2016 • Clayton Schoeny, Antonia Wachter-Zeh, Ryan Gabrys, Eitan Yaakobi

In this paper we close on this gap and provide codes with redundancy at most $\log(n) + (b-1)\log(\log(n)) +b -\log(b)$.

Information Theory Information Theory