New paper:
Polynomially larger deletion codes.
For two deletions, we improve the leading redundancy coefficient to 3.
The previous best coefficient was 4, unchanged since 1965.
The proof is elegant, elementary and formalized.
https://t.co/49cT8ssTjn
@MountainOfMoon Hi Arya, self promo, if you like improvement on old coding bounds, I got one last week for deletions that may interest you
https://t.co/49cT8ssTjn
@ipeirotis AI can already judge the importance of results pretty well and connect it to what we know. It is not yet good enough at explaining, but that could change quickly
New paper:
Polynomially larger deletion codes.
For two deletions, we improve the leading redundancy coefficient to 3.
The previous best coefficient was 4, unchanged since 1965.
The proof is elegant, elementary and formalized.
https://t.co/49cT8ssTjn