This, perhaps, has triggered works from the other end of the spectrum [1]}, [2]} which focused on constructing error correcting codes with constant rate and distance, that are locally testable with smallest possible locality. These works achieve constant rate and quasi-poly-logarithmic distance and locality.
