Cite
An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes.
MLA
Cullina, Daniel, and Negar Kiyavash. “An Improvement to Levenshtein’s Upper Bound on the Cardinality of Deletion Correcting Codes.” IEEE Transactions on Information Theory, vol. 60, no. 7, July 2014, pp. 3862–70. EBSCOhost, https://doi.org/10.1109/TIT.2014.2317698.
APA
Cullina, D., & Kiyavash, N. (2014). An Improvement to Levenshtein’s Upper Bound on the Cardinality of Deletion Correcting Codes. IEEE Transactions on Information Theory, 60(7), 3862–3870. https://doi.org/10.1109/TIT.2014.2317698
Chicago
Cullina, Daniel, and Negar Kiyavash. 2014. “An Improvement to Levenshtein’s Upper Bound on the Cardinality of Deletion Correcting Codes.” IEEE Transactions on Information Theory 60 (7): 3862–70. doi:10.1109/TIT.2014.2317698.