Keyphrases
Additive Combinatorics
35%
Affine
25%
Affine-invariant
47%
Agreement Testing
20%
Alphabet Size
27%
Approximate Duality
32%
Capacity-achieving
35%
Closest Pair
20%
Codeword
65%
Coding for Interactive Communication
20%
Coding Scheme
20%
Communication Complexity
30%
Expander Codes
20%
Fine-grained Reductions
20%
Folded Reed-Solomon Codes
20%
Gilbert-Varshamov Bound
34%
Hardness of Approximation
20%
High Probability
26%
Inner Product
20%
Interactive Oracle Proofs
36%
Lifted Codes
38%
Linear Codes
41%
Linear Time
25%
List Decoding
97%
List Decoding Algorithm
30%
List Decoding Capacity
24%
List Length
47%
List-decodable Codes
50%
List-recoverable Codes
25%
List-recovery
43%
Local Decoding
20%
Local Properties
37%
Local Testing
32%
Locally Correctable Codes
42%
Locally Decodable Codes
23%
Locally Testable
48%
Locally Testable Codes
40%
Multiplicity Codes
20%
Near-linear Time
24%
Polynomial Calculus
20%
Property Testing
30%
Query Complexity
77%
Reed-Muller Codes
25%
Relative Distance
26%
Robustness Testing
20%
Tensor Codes
44%
Two-source Extractors
20%
Mathematics
Affine Subspace
26%
Approximates
40%
Calculus
31%
Closest Pair
20%
Combinatorics
47%
Complexity Space
20%
Correction Algorithm
20%
Decoding Algorithm
38%
Error Correcting Codes
26%
Expander
27%
Finite Field
28%
Gilbert-Varshamov Bound
36%
Linear Code
58%
Linear Time
59%
Local Test
20%
Main Result
26%
Polynomial
100%
Probabilistically checkable proofs
20%
Probability Proportional
20%
Probability Theory
75%
Query Complexity
52%
Rate Tensor
41%
Reed-Muller Code
29%
Tensor
33%
Upper Bound
25%
Computer Science
Affine Invariant
20%
Affine Subspace
20%
Boolean Circuit
20%
Building-Blocks
35%
Communication Complexity
20%
Correction Algorithm
20%
Decoding Algorithm
31%
Error-correcting code
42%
Interactive Communication
20%
Linear Subspace
20%
Local Correction
20%
Polynomial Time
21%
Relative Distance
23%
Space Complexity
20%
Toeplitz Matrix
20%
