Codes Correcting Two Deletions

DOI10.1109/TIT.2018.2876281zbMATH Open1427.94092arXiv1712.07222OpenAlexW2897671136WikidataQ129087102 ScholiaQ129087102MaRDI QIDQ4615355FDOQ4615355

Frederic Sala, Ryan Gabrys

Publication date: 28 January 2019

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: In this work, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log n + O(log log n) bits of redundancy, where n is the length of the code. To the best of the author's knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.

Full work available at URL: https://arxiv.org/abs/1712.07222

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (5)

• New dimension-independent upper bounds on linear insdel codes
• Title not available (Why is that?)
• Insdel codes from subspace and rank-metric codes
• Title not available (Why is that?)
• Information-Theoretic Foundations of DNA Data Storage

This page was built for publication: Codes Correcting Two Deletions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615355)