Cheng, Kuan, Haeupler, Bernhard, Guruswami, Venkatesan, and Li, Xin. Efficient Linear and Affine Codes for Correcting Insertions/Deletions. Retrieved from https://par.nsf.gov/biblio/10214012. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) .
Cheng, Kuan, Haeupler, Bernhard, Guruswami, Venkatesan, & Li, Xin. Efficient Linear and Affine Codes for Correcting Insertions/Deletions. Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), (). Retrieved from https://par.nsf.gov/biblio/10214012.
Cheng, Kuan, Haeupler, Bernhard, Guruswami, Venkatesan, and Li, Xin.
"Efficient Linear and Affine Codes for Correcting Insertions/Deletions". Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (). Country unknown/Code not available. https://par.nsf.gov/biblio/10214012.
@article{osti_10214012,
place = {Country unknown/Code not available},
title = {Efficient Linear and Affine Codes for Correcting Insertions/Deletions},
url = {https://par.nsf.gov/biblio/10214012},
abstractNote = {},
journal = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA)},
author = {Cheng, Kuan and Haeupler, Bernhard and Guruswami, Venkatesan and Li, Xin},
editor = {null}
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.