Locally Testable Codes with constant rate, distance, and locality · HackerPapers discussions

Locally Testable Codes with constant rate, distance, and locality — mentioned by Comevius

Fri, 07 Jan 2022 02:17:47 GMT

I like kicking quantum computing, especially when products tout resistance to it as if the technology is about to become practical, but error correction with a constant complexity could bring the problem to the realm of theoretically surmountable. I had no idea about the c^3 conjencture and how the optimal way to create a classical error correcting code was found not long ago. https://arxiv.org/abs/2111.04808

Paper and discussion history. A mention is not an endorsement.

Locally Testable Codes with constant rate, distance, and locality — mentioned by floatingatoll

Sat, 27 Nov 2021 04:40:29 GMT

See also: Locally Testable Codes with constant rate, distance, and locality https://arxiv.org/abs/2111.04808 For example, from heading “High Dimensional Expansion”: > The current paper is mainly elementary and almost self-contained (with the exception of Section 6 which uses the existence of some Ramanujan Cayley graphs with specific properties and can be taken as a black box). But it came up as a result of a much longer and intensive journey. Some interesting open problems were left aside along the way. It is, therefore, worthwhile to give the story here.

Paper and discussion history. A mention is not an endorsement.

Locally Testable Codes with constant rate, distance, and locality — mentioned by Enginerrrd

Wed, 24 Nov 2021 21:22:44 GMT

https://arxiv.org/abs/2111.04808 for the preprint

Paper and discussion history. A mention is not an endorsement.