Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published June 2020 | public
Book Section - Chapter

Optimal Systematic t-Deletion Correcting Codes

Abstract

Systematic deletion correcting codes play an important role in applications of document exchange. Yet despite a series of recent advances made in deletion correcting codes, most of them are non-systematic. To the best of the authors' knowledge, the only known deterministic systematic t-deletion correcting code constructions with rate approaching 1 achieve O(t log² n) bits of redundancy for constant t, where n is the code length. In this paper, we propose a systematic t-deletion correcting code construction that achieves 4t log n + o(log n) bits of redundancy, which is asymptotically within a factor of 4 from being optimal. Our encoding and decoding algorithms have complexity O(n^(2t+1)), which is polynomial for constant t.

Additional Information

© 2020 IEEE. This work was supported in part by NSF grants CCF-1816965 and CCF-1717884.

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023