Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

DOI10.1109/TIT.2020.3016261MaRDI QIDQ5001720zbMATH OpenOpenAlexFDO

Authors Takehiko Mori, Manabu Hagiwara

Publication date 23 July 2021

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

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

zbMATH Keywords

asymptotic achievability of Levenshtein's upper boundcardinality of perfect multi deletion binary codesfixed code lengthfixed number of deletionslower boundperfect deletion code

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: This paper studies on the cardinality of perfect multi deletion binary codes. The lower bound for any perfect deletion code with the fixed code length and the number of deletions, and the asymptotic achievable of Levenshtein's upper bound are shown.

Cited in

(2)

• Some combinatorial constructions for optimal perfect deletion-correcting codes
• On Optimal k-Deletion Correcting Codes

This page was built for publication: Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

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