🔮
🔮
The Ethereal
Perfect Multi Deletion Codes Achieve the Asymptotic Optimality of Code Size
October 13, 2019 · The Ethereal · 🏛 IEEE Transactions on Information Theory
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Takehiko Mori, Manabu Hagiwara
arXiv ID
1910.06740
Category
math.CO: Combinatorics
Cross-listed
cs.IT
Citations
0
Venue
IEEE Transactions on Information Theory
Last Checked
3 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal