AI Chat AI Image Generator AI Video Text to Speech

Good Locally Testable Codes

07/25/2022

∙

by Irit Dinur, et al.

∙

∙

An explicit construction of locally testable codes of constant rate, constant distance and constant number of queries is given. Hence answering affirmatively the c^3-problem.

Irit Dinur
16 publications
Shai Evra
3 publications
Ron Livne
2 publications
Alexander Lubotzky
4 publications
Shahar Mozes
2 publications

page 1

page 2

page 3

page 4

research

∙ 08/14/2018

Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes

It was shown in GXY18 that the length n of a q-ary linear locally recove...

0 Lingfei Jin, et al. ∙

research

∙ 11/05/2021

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

We study classical and quantum LDPC codes of constant rate obtained by t...

0 Pavel Panteleev, et al. ∙

research

∙ 06/29/2023

Relaxed Local Correctability from Local Testing

We cement the intuitive connection between relaxed local correctability ...

0 Vinayak M. Kumar, et al. ∙

research

∙ 05/03/2020

Locally testable codes via high-dimensional expanders

Locally testable codes (LTC) are error-correcting codes that have a loca...

0 Yotam Dikstein, et al. ∙

research

∙ 01/11/2020

Locally Decodable Codes with Randomized Encoding

We initiate a study of locally decodable codes with randomized encoding....

0 Kuan Cheng, et al. ∙

research

∙ 08/02/2022

On Good 2-Query Locally Testable Codes from Sheaves on High Dimensional Expanders

We expose a strong connection between good 2-query locally testable code...

0 Uriya A. First, et al. ∙

research

∙ 01/27/2022

c^3-Locally Testable Codes from Lossless Expanders

A locally testable code (LTC) is an error correcting code with a propert...

0 Ting-Chun Lin, et al. ∙