Skip to content

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

Daniel Cullina, Negar Kiyavash

VenueBISIT
Year2013
ProceedingsISIT

Browse the full ISIT paper archive.