Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)
Papers
Topics
Authors
Recent
Search
2000 character limit reached

New Construction of qq-ary Codes Correcting a Burst of at most tt Deletions

Published 11 Jan 2024 in cs.IT and math.IT | (2401.05859v3)

Abstract: In this paper, for any fixed positive integers tt and q>2q>2, we construct qq-ary codes correcting a burst of at most tt deletions with redundancy log⁡n+8log⁡log⁡n+o(log⁡log⁡n)+γq,t\log n+8\log\log n+o(\log\log n)+\gamma_{q,t} bits and near-linear encoding/decoding complexity, where nn is the message length and γq,t\gamma_{q,t} is a constant that only depends on qq and tt. In previous works there are constructions of such codes with redundancy log⁡n+O(log⁡qlog⁡log⁡n)\log n+O(\log q\log\log n) bits or log⁡n+O(t2log⁡log⁡n)+O(tlog⁡q)\log n+O(t^2\log\log n)+O(t\log q). The redundancy of our new construction is independent of qq and tt in the second term.

Authors (3)
Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.