Venkatesan Guruswami, Johan Håstad. Explicit two-deletion codes with redundancy matching the existential bound. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 21-32, SIAM, 2022. [doi]
@inproceedings{GuruswamiH22,
title = {Explicit two-deletion codes with redundancy matching the existential bound},
author = {Venkatesan Guruswami and Johan Håstad},
year = {2022},
doi = {10.1137/1.9781611976465.2},
url = {https://doi.org/10.1137/1.9781611976465.2},
researchr = {https://researchr.org/publication/GuruswamiH22},
cites = {0},
citedby = {0},
pages = {21-32},
booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
editor = {Joseph (Seffi) Naor and Niv Buchbinder},
publisher = {SIAM},
isbn = {978-1-61197-707-3},
}