Covering Codes Using Insertions or Deletions

DOI10.1109/TIT.2020.2985691zbMath1473.94163arXiv1911.09944OpenAlexW3015436008MaRDI QIDQ5001724

Cyrus Rashtchian, Eitan Yaakobi, Andreas Lenz, Paul H. Siegel

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/1911.09944

zbMATH Keywords

upper boundscovering codesasymptotic densitybounds for Hamming distance covering codessphere-covering lower bounds on minimum possible size

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (1)

Covering codes for the fixed length Levenshtein metric

This page was built for publication: Covering Codes Using Insertions or Deletions