Succinct representation of codes with applications to testing Elena Grigorescu Tali Kaufman Madhu Sudan.

Slides:



Advertisements
Similar presentations
Hardness of Reconstructing Multivariate Polynomials. Parikshit Gopalan U. Washington Parikshit Gopalan U. Washington Subhash Khot NYU/Gatech Rishi Saket.
Advertisements

PRG for Low Degree Polynomials from AG-Codes Gil Cohen Joint work with Amnon Ta-Shma.
December 2, 2009 IPAM: Invariance in Property Testing 1 Invariance in Property Testing Madhu Sudan Microsoft/MIT TexPoint fonts used in EMF. Read the TexPoint.
Of 22 August 29-30, 2011 Rabin ’80: APT 1 Invariance in Property Testing Madhu Sudan Microsoft Research TexPoint fonts used in EMF. Read the TexPoint manual.
Gillat Kol joint work with Ran Raz Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist.
Cyclic Code.
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Kiran Kedlaya Sergey Yekhanin MIT Microsoft Research.
Fast Algorithms For Hierarchical Range Histogram Constructions
Chapter 6 Sampling and Sampling Distributions
Information and Coding Theory
A UNIFIED FRAMEWORK FOR TESTING LINEAR-INVARIANT PROPERTIES ARNAB BHATTACHARYYA CSAIL, MIT (Joint work with ELENA GRIGORESCU and ASAF SHAPIRA)
Of 37 October 18, 2011 Invariance in Property Testing: Chicago 1 Invariance in Property Testing Madhu Sudan Microsoft Research TexPoint fonts used in EMF.
Of 39 February 22, 2012 Invariance in Property Testing: Yale 1 Invariance in Property Testing Madhu Sudan Microsoft Research TexPoint fonts used in EMF.
Linear Systems With Composite Moduli Arkadev Chattopadhyay (University of Toronto) Joint with: Avi Wigderson TexPoint fonts used in EMF. Read the TexPoint.
1 By Gil Kalai Institute of Mathematics and Center for Rationality, Hebrew University, Jerusalem, Israel presented by: Yair Cymbalista.
Asaf Shapira (Georgia Tech) Joint work with: Arnab Bhattacharyya (MIT) Elena Grigorescu (Georgia Tech) Prasad Raghavendra (Georgia Tech) 1 Testing Odd-Cycle.
Proclaiming Dictators and Juntas or Testing Boolean Formulae Michal Parnas Dana Ron Alex Samorodnitsky.
Sparse Random Linear Codes are Locally Decodable and Testable Tali Kaufman (MIT) Joint work with Madhu Sudan (MIT)
Chapter 7 Sampling and Sampling Distributions
Correcting Errors Beyond the Guruswami-Sudan Radius Farzad Parvaresh & Alexander Vardy Presented by Efrat Bank.
Locally testable cyclic codes Lászl ó Babai, Amir Shpilka, Daniel Štefankovič There are no good families of locally-testable cyclic codes over. Theorem:
Testing Metric Properties Michal Parnas and Dana Ron.
EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.
1 On the Benefits of Adaptivity in Property Testing of Dense Graphs Joint work with Mira Gonen Dana Ron Tel-Aviv University.
1. 2 Overview Some basic math Error correcting codes Low degree polynomials Introduction to consistent readers and consistency tests H.W.
Part III: Inference Topic 6 Sampling and Sampling Distributions
1 2 Introduction In this lecture we’ll cover: Definition of strings as functions and vice versa Error correcting codes Low degree polynomials Low degree.
Ger man Aerospace Center Gothenburg, April, 2007 Coding Schemes for Crisscross Error Patterns Simon Plass, Gerd Richter, and A.J. Han Vinck.
Some 3CNF Properties are Hard to Test Eli Ben-Sasson Harvard & MIT Prahladh Harsha MIT Sofya Raskhodnikova MIT.
September 20, 2010 Invariance in Property Testing 1 Madhu Sudan Microsoft/MIT TexPoint fonts used in EMF. Read the TexPoint manual before you delete this.
Of 38 July 29, 2011 Invariance in Property Testing: EPFL 1 Invariance in Property Testing Madhu Sudan Microsoft Research TexPoint fonts used in EMF. Read.
March 20-24, 2010 Babai-Fest: Invariance in Property Testing 1 Invariance in Property Testing Madhu Sudan Microsoft/MIT TexPoint fonts used in EMF. Read.
Linear codes 1 CHAPTER 2: Linear codes ABSTRACT Most of the important codes are special types of so-called linear codes. Linear codes are of importance.
January 8-10, 2010 ITCS: Invariance in Property Testing 1 Invariance in Property Testing Madhu Sudan Microsoft/MIT TexPoint fonts used in EMF. Read the.
Correlation testing for affine invariant properties on Shachar Lovett Institute for Advanced Study Joint with Hamed Hatami (McGill)
Cyclic codes 1 CHAPTER 3: Cyclic and convolution codes Cyclic codes are of interest and importance because They posses rich algebraic structure that can.
Of 29 August 4, 2015SIAM AAG: Algebraic Codes and Invariance1 Algebraic Codes and Invariance Madhu Sudan Microsoft Research.
The Quasi-Randomness of Hypergraph Cut Properties Asaf Shapira & Raphael Yuster.
Sub-Constant Error Low Degree Test of Almost-Linear Size Dana Moshkovitz Weizmann Institute Ran Raz Weizmann Institute.
Uncorrectable Errors of Weight Half the Minimum Distance for Binary Linear Codes Kenji Yasunaga * Toru Fujiwara + * Kwansei Gakuin University, Japan +
Cyclic Codes for Error Detection W. W. Peterson and D. T. Brown by Maheshwar R Geereddy.
1 Yuan Luo Xi’an Jan Optimum Distance Profiles of Linear Block Codes Shanghai Jiao Tong University.
Information and Coding Theory Cyclic codes Juris Viksna, 2015.
1 Asymptotically good binary code with efficient encoding & Justesen code Tomer Levinboim Error Correcting Codes Seminar (2008)
International Iran conference on Quantum Information September 2007, Kish Island Evaluation of bounds of codes defined over hexagonal and honeycomb lattices.
Locally Testable Codes and Caylay Graphs Parikshit Gopalan (MSR-SVC) Salil Vadhan (Harvard) Yuan Zhou (CMU)
Of 40 May 23-28, 2011 Bertinoro: Testing Affine-Invariant Properties 1 Testing Affine-Invariant Properties Madhu Sudan Microsoft TexPoint fonts used in.
RS – Reed Solomon Error correcting code. Error-correcting codes are clever ways of representing data so that one can recover the original information.
Chapter 6 Sampling and Sampling Distributions
Tali Kaufman (Bar-Ilan)
Algebraic Property Testing:
Inductive Proof (the process of deriving generalities from particulars) Mathematical Induction (reasoning over the natural numbers)
Locality in Coding Theory II: LTCs
Hans Bodlaender, Marek Cygan and Stefan Kratsch
Locality in Coding Theory
Local Decoding and Testing Polynomials over Grids
Algebraic Codes and Invariance
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Arithmetic Statistics in Function Fields
Locally Decodable Codes from Lifting
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Linear sketching over
Invariance in Property Testing
Algebraic Property Testing
Low-Degree Testing Madhu Sudan MSR Survey … based on many works
Locality in Coding Theory II: LTCs
Testing Affine-Invariant Properties
I.4 Polyhedral Theory (NW)
Every set in P is strongly testable under a suitable encoding
I.4 Polyhedral Theory.
Presentation transcript:

Succinct representation of codes with applications to testing Elena Grigorescu Tali Kaufman Madhu Sudan

Outline ► Testing membership in error correcting codes ► Sufficient conditions for testing algebraic codes ► Possible promising perspective: rich group of symmetries of code ► Our result: affine/cyclic invariant, sparse codes can be described succinctly by a single, short codeword ► Implies locally testability results ► Proof sketch ► Conclusions

C Locally testable codes C C satisfies Code: Linear: -Accept w.p 1 if -Reject w.p. ε if ( independent of n) q queries 011…0

Testing linear codes via duality ► ► [BHR] Test for linear properties are essentially of the form: 1.Given x, pick 2.Accept iff ► Locality of test: ► Dual-distance: smallest weight of a codeword in dual-C

Sufficient conditions for testing  Necessary condition for local testing (linear codes): - small “dual distance” - small “dual distance” - not sufficient( [BHR] show random LDPC not locally testable) - not sufficient( [BHR] show random LDPC not locally testable)  Sufficient conditions - Possible approach: nice symmetries of code - Possible approach: nice symmetries of code  C is invariant under permutation iff 

Symmetries and testing Many known testable codes have somewhat large symmetry groups: Eg. Linearity: invariance under general linear group Low degree, Reed-Muller, BCH: invariance under affine group Low degree, Reed-Muller, BCH: invariance under affine group Specific sufficient condition: [KS] affine invariance + ‘local characterization’ imply testing [KS] affine invariance + ‘local characterization’ imply testing AKKLR Conjecture: 2 transitivity + small dual distance Falsified in general [GKS] Falsified in general [GKS] Modified AKKLR Question: What if dual code is generated by single low-weight codeword and its shifts under some group G (“Single- Orbit Property under G”) Are these codes testable (for some group G? for all groups G?) Are these codes testable (for some group G? for all groups G?)

Single orbit property under affine invariant/cyclic groups ► Affine group: ► Cyclic group: ► C has single orbit under cyclic group: w=01001 then B={01001, 10100, 01010, 00101, 10010} is a basis for C w=01001 then B={01001, 10100, 01010, 00101, 10010} is a basis for C ► Formally, C has k-single orbit under G ( included in Aut(C) ) if

Our work ► Study “Single-Orbit Property” of common codes. ► Def: C is sparse if it contains a poly number of codewords ► Duals of binary sparse + affine invariant codes have the single-orbit property under affine group - under some block-length restriction: n prime - under some block-length restriction: n prime - [KS’08] Single-orbit codes under affine group are testable. - [KS’08] Single-orbit codes under affine group are testable. ► Duals of binary sparse + cyclic invariant codes have the single-orbit property under cyclic group - under more block-length restrictions: n, N-1 primes - under more block-length restrictions: n, N-1 primes - No testing implications - No testing implications

► Sparse, large distance codes are testable [KL, KS] ( tests are coarse, unstructured) [KL, KS] ( tests are coarse, unstructured) ► Affine/linear invariant + “characterization” imply testing ► Here: sparse large distance affine invariance “characterization” (explicit tests) affine invariance “characterization” (explicit tests) ► [KL] dual-e-BCH codes are testable (unstructured tests) ► e-BCH are spanned by shortest codewords ► Here: dual-e-BCH are spanned by a single, short codeword (explicit basis / tests) Related works

Toward an explicit description of binary affine invariant codes ► Affine invariance: ► Any function is of the form ► The Trace function:

► Let - What aff inv families does f belong to? - What aff inv families does f belong to? ► Consider the binary rep of degrees: 1, 111, 1100,  Then ► In general: if degree d occurs then its shadow occurs ► Sparsity translates into few monomials ► Affine/Cyclic codes are described by a small set of degrees Explicit description of sparse affine families Shadow(10011) = {10011,10010,10001,10000,11,10,1}

 Strong number theoretic result of Bourgain implies high weight of functions of the form few degs > deg deg< Proof ingredients 0 Degs inside trace Weil boundsBourgain ?

Proof ingredients (contd)  MacWilliams type counting estimates - fourier transform between the functions that represent number of codewords for each weight in C and in dual- C, respectively  For sparse codes of length N and of high distance obtain:

Proof sketch ► C described by set of degrees D ► Let dual-C’= Span( aff(w) ) ► If C’ C then there exists ► Let ► Associate C(a) to codew. w ► Does every wt<k codew. belong to a dual of some C(a) ? ► New goal: exists w that does not belong to the dual of any C(a), for all a ► We show C weight<k Dual-C w Dual-C’ Want: exists codew. c with wt < k s.t. Span(aff(c))=Dual-C C’ C(a)

Proof Sketch ► C, C(a): sparse, high dist (Bourgain) (assuming N-1 and n are primes) ► How many codew of wt k in dual-C? ► How many codew of wt k in dual-C(a) ? ► Total number of degrees a to consider: N/n ► Therefore, there exists codew. of wt<k in dual-C that whose orbit generates C

Specifics of the affine case proof ► Here only assume n prime- Bourgain doesn’t hold for all monomials ► Need codes C(a) to have deg a < ► Use shadow property ► Show that enough to consider a in the set

Cyclic codes ► Invariant under: ► Punctured affine invariant codes are cyclic ► Cyclic codes are described by generator polynomial (or its roots in the field) ► Alternatively described by function families of the form ► Degrees can be arbitrary

Single orbit: affine vs cyclic codes ► Affine (length N= )  n prime  degrees of monomials are shadow closed  |Aut(C)|=  “single orbit” implies testing ► Cyclic (length N-1)  n, N-1 primes  degrees of monomials are arbitrary  |Aut(C)|=N  not known if “single orbit” implies testing

Open Questions ► Do same results hold for non-prime n, ? ► Single orbit under what other groups imply testing? How large does the Aut group should be to imply testing? ► Small weight basis + invariance implies testing? ► Examples of families where the tests are not the “expected” ones (I.e. not the ones suggested by the description of Aut group)

Thank you