Feb 25, 2024 · A q-locally correctable code (LCC) C: 0 1 k 0 1 n is a code in which it is possible to correct every bit of a (not too) corrupted codeword.

Let C : {0,1}k → {0,1}n be a linear (3, δ, ε). Then n = 2Ω(δ2k1/8). Besides the strong bound their result also established a separation and 3-LCCs and.

A q-locally correctable code (LCC) $C:\{0,1\}^{k}\rightarrow \{0,1\}^{n}$ is a code in which it is possible to correct every bit of a (not too) corrupted ...

We turn to define extended decoding sequences, in order to handle repeated suffixes. For what comes next, we fix some s and some f ≥ 1. We will need the ...

Dec 3, 2024 · Here, we prove a stronger version of the observable speed limit and show that the previously obtained bound is a special case of the new bound.

Oct 19, 2024 · Talk by Tai Yankovitz Title: A stronger bound for linear 3-LCC paper link: https://eccc.weizmann.ac.il/report/2024/036/

Date: Tuesday, 28 January, 2025 - 14:00 to 15:00 ; Speaker: Tal Yankovitz (Tel-Aviv University) ; Venue: Computer Laboratory, William Gates Building, Room SS03.

In a breakthrough result Kothari and Manohar (STOC 2024) showed that for linear 3-LCC n=2Ω(k1/8) . In this work we prove that n=2Ω(k1/4) . As Reed-Muller codes ...

Nov 1, 2023 · The blocklength of a linear 3-query LCC with constant distance over any small field grows exponentially with k. This improves on the best prior lower bound of ...

Apr 8, 2024 · Previous bounds for 3-query linear LCCs proceed by constructing a 2-query locally decodable code (LDC) from the 3-query linear LCC/LDC and ...