  A locally testable code (LTC) is an error correcting code with a property
tester. The tester tests if a word is codeword by reading constant random bits
and rejects the word with probability proportional to the distance from the
word to the closest codeword. An important open question until recently is
whether there exist $c^3$-LTCs which are LTCs with constant rate, constant
relative distance and constant locality. In this work, we construct a new LTC
family using 1-sided lossless expanders and balanced products.
