vix.ing · top · new · best · stats · spec

c3-Locally Testable Codes from Lossless Expanders

2022/01/27 by Ting-Chun Lin, Min-Hsiu Hsieh, Lin, Ting-Chun +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #Cryptography and Data Security #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT)

paper · pdf · doi:10.48550/arxiv.2201.11369

openalex publication_date 2022/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 c3-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.

Related