Some New Constructions of q-ary Codes for Correcting a Burst of at Most t Deletions

In this paper, we construct q-ary codes for correcting a burst of at most t deletions, where t,q≥2 are arbitrarily fixed positive integers. We consider two scenarios of error correction: the classical error correcting codes, which recover each codeword from one read (channel output), and the reconstruction codes, which allow to recover each codeword from multiple channel reads. For the first scenario, our construction has redundancy logn+8loglogn+o(loglogn) bits, encoding complexity O(q7tn(logn)3) and decoding complexity O(nlogn). For the reconstruction scenario, our construction can recover the codewords with two reads and has redundancy 8loglogn+o(loglogn) bits. The encoding complexity of this construction is Oq7tn(logn)3, and decoding complexity is Oq9t(nlogn)3. Both of our constructions have lower redundancy than the best known existing works. We also give explicit encoding functions for both constructions that are simpler than previous works.