Approximate ListDecoding and Hardnes Amplification近似列表解码和硬度扩增.ppt

* V-Test: Harmony Almost all B1 = (E,D1) and B2 = (E,D2) in Cons (with |E|=|A|) satisfy C(A, B1)E ? C(A, B2)E B D2 D1 A E Proof: Symmetry between A and E (few errors in AuE ) Chernoff: 2 ? exp(-kα) E A Implication: Restricted to Cons, an approx V-Test on E accepts almost surely: Unique Decode! Harmony ) Local DP Main Lemma: Assume (A,B) is harmonious. Define g(x) = Plurality { C(A,B’)x | B’2 Cons x 2 B’ } Then C(A,B’)B’ ? gk (B’), for almost all B’ 2 Cons B A A D2 D1 E Intuition: g = g(A,B) is the unique (approximate) decoding of C on Cons(A,B) B’ x Idea: Symmetry arguments. Largness guarantees that random selections are near-uniform. Challenge: Our analysis gets stuck in 2 ? exp(-√k) Can one get 2 ? exp(-k) ?? Local DP structure across Uk Field of flowers (Ai,Bi) For each, gi s.t C(S) ? gik (S) if S2 Cons(Ai,Bi) Global g? B2 A A2 Bi A Ai B A A B3 A A3 B1 A A1 From local DP to global DPQ: How to “glue” local solutions ?A: If a typical S has two disjoint large, harmonious A’s2 1/kα high probability (2 queries) [DG]2 exp(-kα) Z-test (3 queries) [IKW] DerandomizationDP code whose length ispoly (|U|), instead of |U|k  Inclusion graphs are Samplers Most lemmas analyze sampling properties m-subsets A ? Subsets: Chernoff bounds – exponential error Subspaces: Chebychev bounds – polynomial error Cons S k-subsets x elements of U Derandomized DP Test Derandomized DP: U=(Fq)d Encode fk (S), S subspace of const dimension (as [IJKW08] ) Theorem (Derandomized V-Test): If derandomized V-Test accepts C with probability 2 poly(1/k), then there is a function g : U ? R such that C (S) ? gk (S) on poly(2) of subspaces S. Corollary: Polynomial rate testable DP-code with [DG] parameters! Summary Spherical cubes exist Power of consistency Counterexample [DG] For every x 2 U pick a random gx: U ? R For every k-subset S pick a random x(S) 2 S