Locally Decodable codes(LDC) support decoding of any particular symbol of the input message by reading constant number of symbols of the codeword, even in presence of constant fraction of errors. In a recent breakthrough [9], Yekhanin constructed 3-query LDCs that hugely improve over earlier constructions. Specifically, for a Mersenne prime p = 2−1, binary LDCs of length 2O(n1/t) for infinitely...