Nonasymptotic Upper Bounds for Deletion Correcting Codes

DOI10.1109/TIT.2013.2257917zbMath1364.94759arXiv1211.3128OpenAlexW2963183421MaRDI QIDQ5346436

Ankur A. Kulkarni, Negar Kiyavash

Publication date: 8 June 2017

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

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Other types of codes (94B60) Burst-correcting codes (94B20)

Related Items (2)

On the Varshamov-Tenengolts construction on binary strings ⋮ Duplication-correcting codes

This page was built for publication: Nonasymptotic Upper Bounds for Deletion Correcting Codes