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