New work with the amazing @gwberg95!
We show that the Closest Vector and Nearest Codeword problems are hard to approximate, even with preprocessing and with nearly tight approximation factors matching the best algorithms.
Paper: https://t.co/ltkof8KkYS
New paper with the brilliant Dor Minzer, Guy Weissenberg, and Kai Zhe Zheng: a separation between RLDC and LDC via HDX-based PCP. This one is special to me; it answers a question Oded Goldreich asked me in my 1st PhD year, and it stuck with me ever since.
https://t.co/8VI8RhWPyU