An improvement to Levenshtein's upper bound on the cardinality of deletion correcting codes - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Daniel Cullina' in GoogleThis author has not been identified. Look up 'Negar Kiyavash' in Google

runs on WebDSL