Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size

DOI10.1109/TIT.2020.3016261zbMath1473.94059arXiv1910.06740OpenAlexW3048887766MaRDI QIDQ5001720

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

lower boundasymptotic achievability of Levenshtein's upper boundcardinality of perfect multi deletion binary codesfixed code lengthfixed number of deletionsperfect deletion code

Mathematics Subject Classification ID

Source coding (94A29)

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