Codes Correcting Two Deletions

DOI10.1109/TIT.2018.2876281MaRDI QIDQ4615355zbMATH OpenOpenAlexWikidataFDO

Authors Ryan Gabrys, Frederic Sala

Publication date 28 January 2019

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

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.

Cited in

(7)

• scientific article; zbMATH DE number 5302391 (Why is no real title available?)
• scientific article; zbMATH DE number 605666 (Why is no real title available?)
• Information-Theoretic Foundations of DNA Data Storage
• Insdel codes from subspace and rank-metric codes
• New dimension-independent upper bounds on linear insdel codes
• Explicit construction of codes correcting a single reverse-complement duplication of arbitrary length
• On the decoding error weight of one or two deletion channels

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)