An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes

Daniel Cullina, Negar Kiyavash. An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. pages 699-703, IEEE, 2013. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: