Venkatesan Guruswami, Johan Håstad. Explicit two-deletion codes with redundancy matching the existential bound. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 21-32, SIAM, 2021. [doi]
@inproceedings{GuruswamiH21, title = {Explicit two-deletion codes with redundancy matching the existential bound}, author = {Venkatesan Guruswami and Johan Håstad}, year = {2021}, doi = {10.1137/1.9781611976465.2}, url = {https://doi.org/10.1137/1.9781611976465.2}, researchr = {https://researchr.org/publication/GuruswamiH21}, cites = {0}, citedby = {0}, pages = {21-32}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}, editor = {Dániel Marx}, publisher = {SIAM}, isbn = {978-1-61197-646-5}, }