1 / 30

Locally correctable codes from lifting

Locally correctable codes from lifting. Alan Guo MIT CSAIL Joint work with Swastik Kopparty (Rutgers) and Madhu Sudan (Microsoft Research). Talk outline. Error correcting codes Locally correctable codes Our contributions New high rate LCCs General framework of “lifting” codes

dunn
Download Presentation

Locally correctable codes from lifting

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Locally correctable codesfrom lifting Alan Guo MIT CSAIL Joint work with SwastikKopparty(Rutgers) and Madhu Sudan (Microsoft Research)

  2. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework of “lifting” codes • New lower bounds for Nikodym sets

  3. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework of “lifting” codes • New lower bounds for Nikodym sets

  4. Error correcting codes • Encoding , Code • Rate = • Distance = minimum pairwise Hamming distance between codewords • Example: Reed-Solomon code • Message: polynomial of degree • Encoding: evaluations at distinct points

  5. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework for “lifting” codes • New lower bounds for Nikodym sets

  6. Locality • Would like to do certain tasks while making sublinear number of queries to symbols of received word • Testing: decide if or if is far from • Decoding:recover a particular symbol of message corresponding to nearest codeword • Correcting: recover a particular symbol of the nearest codeword

  7. Bivariate polynomial codes • Message: bivariate polynomial of degree • Encoding: Evaluations on every point on plane • Schwartz-Zippel Lemma • ; worse than RS! Why bother? • Advantage: locality -queries to correct a symbol

  8. Local correctability

  9. A brief history of LCCs • Want high rate with sublinear query complexity for constant fraction errors • Bivariate polynomial codes • queries, but rate • More generally, -variate polynomial codes get us queries, but rate • Multiplicity codes (Kopparty, Saraf, Yekhanin 2010) • Encode polynomial evaluations as well as derivatives • Can achieve queries with rate close to 1

  10. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework for “lifting” codes • New lower bounds for Nikodym sets

  11. Our contributions • New codes with queries and rate close to 1 • General study of “lifted codes” • New lower bounds for Nikodym sets

  12. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework for “lifting” codes • New lower bounds for Nikodym sets

  13. Main idea • New code (lifted RS code) • Codewords = {bivariate polynomials whose restrictions to lines are polynomials of deg} • Contains bivariate polynomials of deg, but sometimes many more codewords • Code has basis of monomials • Characterize which belong in code • Lower bound rate of code by lower bounding number of such

  14. Main idea • Example: , has degree but on each line looks like degree because in , i.e. polynomials are only distinguishable modulo by looking at evaluations in

  15. Main idea • New code (lifted RS code) • Codewords = {bivariate polynomials whose restrictions to lines are polynomials of deg} • Contains bivariate polynomials of deg, but sometimes many more codewords • Code has basis of monomials • Characterize which belong in code • Lower bound rate of code by lower bounding number of such

  16. Dimension of lifted RS code • Shadows, and Lucas’ Theorem • Let denote base expansion • Shadow: if for every • Lucas’ Theorem only if which implies

  17. Dimension of lifted RS code • Example: • Over field of characteristic 2,

  18. Dimension of lifted RS code • When is in lifted code? • Expand: • So is in lift ifffor every and , where

  19. Dimension of lifted RS code • , Lifted Reed-Solomon Reed-Muller

  20. Dimension of lifted RS code • , Lifted Reed-Solomon Reed-Muller

  21. Dimension of lifted RS code • , Lifted Reed-Solomon Reed-Muller

  22. Dimension of lifted RS code • , Lifted Reed-Solomon Reed-Muller

  23. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework for “lifting” codes • New lower bounds for Nikodym sets

  24. General results • Affine-invariant codes • for affine permutation • Lifts • Restrictions to low-dim affine subspaces are codewords in “base code” • Good distance • Good locality • Only need to analyze dimension

  25. Talk outline • Error correcting codes • Locally correctable codes • Our contributions • New high rate LCCs • General framework for “lifting” codes • New lower bounds for Nikodym sets

  26. Application to Nikodym sets • Multivariate polynomials outside of coding theory • Polynomial method (Dvir’s analysis of Kakeya sets) • Nikodym set • For every point , there is a line through which is contained in the set, except possibly • Can get lower bound of using polynomial method • Using multiplicity codes, can get bound • Using lifted codes, can get bound

  27. Application to Nikodym sets • Polynomial method • Assume dimension of{-variate polynomial code of deg} • Exists nonzero vanishing identically on • actually vanishes everywhere! • Let • Exists line through that intersects in points • vanishes at points, but has deg • , so

  28. Application to Nikodym sets • Improved polynomial method • Assume dimension of{lifted RS code of deg} • Exists nonzero vanishing identically on • actually vanishes everywhere! • Let • Exists line through that intersects in points • vanishes at points, but has deg • , so

  29. Summary • Lifting • Natural operation • Build longer codes from short ones • Preserve distance • Gain locality • Can get high rate • Applications outside of coding theory • Improve polynomial method (e.g. Nikodym sets)

  30. Thank you!

More Related