TY - GEN

T1 - Local computation in codes

AU - Kaufman, Tali

PY - 2010

Y1 - 2010

N2 - A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes roughly as much time as takes to read one bit of the data! If the fraction of errors is below a certain threshold, a locally decodeable code would allow one to recover every bit of the original message, again, in time which is roughly the time to read one bit of the data. Are such locally testable/decodeable codes of constant rate possible? So far we don't know, but surprisingly-good codes are known. Following, we survey some of the literature and discuss a connection between these notions to symmetric LDPC codes.

AB - A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes roughly as much time as takes to read one bit of the data! If the fraction of errors is below a certain threshold, a locally decodeable code would allow one to recover every bit of the original message, again, in time which is roughly the time to read one bit of the data. Are such locally testable/decodeable codes of constant rate possible? So far we don't know, but surprisingly-good codes are known. Following, we survey some of the literature and discuss a connection between these notions to symmetric LDPC codes.

UR - http://www.scopus.com/inward/record.url?scp=80051920182&partnerID=8YFLogxK

U2 - 10.1109/cig.2010.5592932

DO - 10.1109/cig.2010.5592932

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:80051920182

SN - 9781424482641

T3 - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

BT - 2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

T2 - 2010 IEEE Information Theory Workshop, ITW 2010

Y2 - 30 August 2010 through 3 September 2010

ER -