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

Daniel Cullina, Negar Kiyavash

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Fingerprint

Dive into the research topics of 'An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes'. Together they form a unique fingerprint.

Mathematics