Local computation in codes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
StatePublished - 2010
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: 30 Aug 20103 Sep 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Conference

Conference2010 IEEE Information Theory Workshop, ITW 2010
Country/TerritoryIreland
CityDublin
Period30/08/103/09/10

Fingerprint

Dive into the research topics of 'Local computation in codes'. Together they form a unique fingerprint.

Cite this