7 citations · 9 across the 8 of their papers we have counts for
3 papers · 1 filter
Relaxed Locally Correctable Codes in Computationally Bounded Channels
Jeremiah Blocki, Venkata Gandikota, Elena Grigorescu +1
Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications.…
Lattice-based Locality Sensitive Hashing is Optimal
Karthekeyan Chandrasekaran, Daniel Dadush, Venkata Gandikota +1
Locality sensitive hashing (LSH) was introduced by Indyk and Motwani (STOC `98) to give the first sublinear time algorithm for the c-approximate nearest neighbor (ANN) problem usin…
Local Testing for Membership in Lattices
Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota +1
Motivated by the structural analogies between point lattices and linear error-correcting codes, and by the mature theory on locally testable codes, we initiate a systematic study o…