$c^3$-Locally Testable Codes from Lossless Expanders
Information Theory
2022-01-31 v2 Computational Complexity
math.IT
Abstract
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 -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.
Cite
@article{arxiv.2201.11369,
title = {$c^3$-Locally Testable Codes from Lossless Expanders},
author = {Ting-Chun Lin and Min-Hsiu Hsieh},
journal= {arXiv preprint arXiv:2201.11369},
year = {2022}
}