24 citations · 87 across the 36 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011
Making the long code shorter, with applications to the Unique Games Conjecture
Boaz Barak, Parikshit Gopalan, Johan Hastad +3
The long code is a central tool in hardness of approximation, especially in questions related to the unique games conjecture. We construct a new code that is exponentially more eff…
cs.IT2011★ 4 cited
On the Locality of Codeword Symbols
Parikshit Gopalan, Cheng Huang, Huseyin Simitci +1
Consider a linear [n,k,d]_q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates o…