Discover and read the best of Twitter Threads about #probabilisticallycheckableproofs

Most recents (1)

#DinurEvraLivneLubotzkyMozes-3
"1 Introduction
A locally testable code (LTC) is an #ErrorCorrectingCode that has a property-tester. The tester reads 𝑞 bits (randomly - but not necessarily uniformly chosen) from a given word, and rejects words with probability proportional to
>
>their distance from the code. The parameter 𝑞 is called the locality of the tester.

A random code has, with high probability, constant rate and distance, but locality that is proportional to the length. This is true even for random #LDPC codes [BHR05], and
>
>a priori the mere existence of codes with constant locality is not obvious. The first LTCs appear implicitly in works on #ProgramChecking [BLR90] and on #ProbabilisticallyCheckableProofs (PCPs) [BFL91, LFKN92, BFLS91, AS98, ALM+98].

> ImageImage
Read 10 tweets

Related hashtags

Did Thread Reader help you today?

Support us! We are indie developers!


This site is made by just two indie developers on a laptop doing marketing, support and development! Read more about the story.

Become a Premium Member ($3.00/month or $30.00/year) and get exclusive features!

Become Premium

Too expensive? Make a small donation by buying us coffee ($5) or help with server cost ($10)

Donate via Paypal Become our Patreon

Thank you for your support!