Sublinear-Time Error-Correction and Error-Detection

Slides:



Advertisements
Similar presentations
Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes Kenji Obata.
Advertisements

Hardness of Reconstructing Multivariate Polynomials. Parikshit Gopalan U. Washington Parikshit Gopalan U. Washington Subhash Khot NYU/Gatech Rishi Saket.
Hardness Amplification within NP against Deterministic Algorithms Parikshit Gopalan U Washington & MSR-SVC Venkatesan Guruswami U Washington & IAS.
PRG for Low Degree Polynomials from AG-Codes Gil Cohen Joint work with Amnon Ta-Shma.
Average-case Complexity Luca Trevisan UC Berkeley.
Multiplicity Codes Swastik Kopparty (Rutgers) (based on [K-Saraf-Yekhanin ’11], [K ‘12], [K ‘14])
Approximate List- Decoding and Hardness Amplification Valentine Kabanets (SFU) joint work with Russell Impagliazzo and Ragesh Jaiswal (UCSD)
Noise, Information Theory, and Entropy (cont.) CS414 – Spring 2007 By Karrie Karahalios, Roger Cheng, Brian Bailey.
An Ω(n 1/3 ) Lower Bound for Bilinear Group Based Private Information Retrieval Alexander Razborov Sergey Yekhanin.
Locally Decodable Codes from Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers Kiran Kedlaya Sergey Yekhanin MIT Microsoft Research.
296.3Page :Algorithms in the Real World Error Correcting Codes II – Cyclic Codes – Reed-Solomon Codes.
1. 2 Overview Review of some basic math Review of some basic math Error correcting codes Error correcting codes Low degree polynomials Low degree polynomials.
15-853:Algorithms in the Real World
Probabilistic verification Mario Szegedy, Rutgers www/cs.rutgers.edu/~szegedy/07540 Lecture 4.
List decoding Reed-Muller codes up to minimal distance: Structure and pseudo- randomness in coding theory Abhishek Bhowmick (UT Austin) Shachar Lovett.
Locally Decodable Codes
Probabilistically Checkable Proofs Madhu Sudan MIT CSAIL 09/23/20091Probabilistic Checking of Proofs TexPoint fonts used in EMF. Read the TexPoint manual.
Sparse Random Linear Codes are Locally Decodable and Testable Tali Kaufman (MIT) Joint work with Madhu Sudan (MIT)
1 Robust PCPs of Proximity (Shorter PCPs, applications to Coding) Eli Ben-Sasson (Radcliffe) Oded Goldreich (Weizmann & Radcliffe) Prahladh Harsha (MIT)
Locally testable cyclic codes Lászl ó Babai, Amir Shpilka, Daniel Štefankovič There are no good families of locally-testable cyclic codes over. Theorem:
Private Information Retrieval. What is Private Information retrieval (PIR) ? Reduction from Private Information Retrieval (PIR) to Smooth Codes Constructions.
1 Streaming Computation of Combinatorial Objects Ziv Bar-Yossef U.C. Berkeley Omer Reingold AT&T Labs – Research Ronen.
1. 2 Overview Some basic math Error correcting codes Low degree polynomials Introduction to consistent readers and consistency tests H.W.
Locally Decodable Codes Uri Nadav. Contents What is Locally Decodable Code (LDC) ? Constructions Lower Bounds Reduction from Private Information Retrieval.
CS151 Complexity Theory Lecture 10 April 29, 2004.
Lecture 20: April 12 Introduction to Randomized Algorithms and the Probabilistic Method.
Linear-Time Encodable and Decodable Error-Correcting Codes Jed Liu 3 March 2003.
CS151 Complexity Theory Lecture 9 April 27, 2004.
Some 3CNF Properties are Hard to Test Eli Ben-Sasson Harvard & MIT Prahladh Harsha MIT Sofya Raskhodnikova MIT.
CS774. Markov Random Field : Theory and Application Lecture 10 Kyomin Jung KAIST Oct
Hamming Codes 11/17/04. History In the late 1940’s Richard Hamming recognized that the further evolution of computers required greater reliability, in.
©2003/04 Alessandro Bogliolo Background Information theory Probability theory Algorithms.
Of 28 Probabilistically Checkable Proofs Madhu Sudan Microsoft Research June 11, 2015TIFR: Probabilistically Checkable Proofs1.
Approximating the MST Weight in Sublinear Time Bernard Chazelle (Princeton) Ronitt Rubinfeld (NEC) Luca Trevisan (U.C. Berkeley)
Great Theoretical Ideas in Computer Science.
1 Private codes or Succinct random codes that are (almost) perfect Michael Langberg California Institute of Technology.
Information Theory Linear Block Codes Jalal Al Roumy.
The Price of Uncertainty in Communication Brendan Juba (Washington U., St. Louis) with Mark Braverman (Princeton)
Basic Concepts of Encoding Codes and Error Correction 1.
1 Asymptotically good binary code with efficient encoding & Justesen code Tomer Levinboim Error Correcting Codes Seminar (2008)
List Decoding Using the XOR Lemma Luca Trevisan U.C. Berkeley.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
INFORMATION THEORY Pui-chor Wong.
Complexity 24-1 Complexity Andrei Bulatov Interactive Proofs.
NP ⊆ PCP(n 3, 1) Theory of Computation. NP ⊆ PCP(n 3,1) What is that? NP ⊆ PCP(n 3,1) What is that?
Exercise in the previous class (1) Define (one of) (15, 11) Hamming code: construct a parity check matrix, and determine the corresponding generator matrix.
RS – Reed Solomon Error correcting code. Error-correcting codes are clever ways of representing data so that one can recover the original information.
Tali Kaufman (Bar-Ilan)
Algebraic Property Testing:
Property Testing (a.k.a. Sublinear Algorithms )
Introduction to Randomized Algorithms and the Probabilistic Method
Randomness and Computation
Locality in Coding Theory II: LTCs
Approximating the MST Weight in Sublinear Time
Umans Complexity Theory Lectures
Locality in Coding Theory
Sublinear-Time Error-Correction and Error-Detection
Pseudorandom bits for polynomials
Maximally Recoverable Local Reconstruction Codes
Local Error-Detection and Error-correction
Locally Decodable Codes from Lifting
Beer Therapy Madhu Ralf Vote early, vote often
Information Redundancy Fault Tolerant Computing
Cyclic Code.
Distributed Compression For Binary Symetric Channels
Locality in Coding Theory II: LTCs
CS21 Decidability and Tractability
CS151 Complexity Theory Lecture 10 May 2, 2019.
CS151 Complexity Theory Lecture 7 April 23, 2019.
Zeev Dvir (Princeton) Shachar Lovett (IAS)
Presentation transcript:

Sublinear-Time Error-Correction and Error-Detection Luca Trevisan U.C. Berkeley luca@eecs.berkeley.edu

Contents Survey of results on error-correcting codes with sub-linear time checking and decoding procedures Results originated in complexity theory

Error-correction

Error-detection

Minimum Distance

Ideally Constant information rate Linear minimum distance Very efficient decoding Sipser-Spielman: linear time deterministic procedure

Sub-linear time decoding? Must be probabilistic Must have some probability of incorrect decoding Even so, is it possible?

Motivations & Context Sub-linear time decoding useful for worst-case to average-case reductions, and in information-theoretic Private Information Retrieval Sub-linear time checking arises in PCP Useful in practice?

Error-correction

Hadamard Code

Example is… Encoding of… 1

“Constant time” decoding

Analysis

A Lower Bound If: the code is linear, the alphabet is small, and the decoding procedure uses two queries Then exponential encoding length is necessary Goldreich-Trevisan, Samorodnitsky

More trade-offs For k queries and binary alphabet: More complicated formulas for bigger alphabet

Construction without polynomials

Construction with polynomials View message as polynomial p:Fk->F of degree d (F is a field, |F| >> d) Encode message by evaluating p at all |F|k points To encode n-bits message, can have |F| polynomial in n, and d,k around (log n)O(1)

To reconstruct p(x) Pick a random line in Fk passing through x; evaluate p on d+1 points of the line; by interpolation, find degree-d univariate polynomial that agrees with p on the line Use interp’ing polynomial to estimate p(x) Algorithm reads p in d+1 points, each uniformly distributed Beaver-Feigenbaum; Lipton; Gemmel-Lipton-Rubinfeld-Sudan-Wigderson

x+(d+1)y x+2y x+y x

Error-detection

Checking polynomial codes Consider encoding with multivariate low-degree polynomials Given p, pick random z, do the decoding for p(z), compare with actual value of p(z) “Simple” case of low-degree test. Rejection prob. proportional to distance from code. Rubinfeld-Sudan

Bivariate Code 2x2 + xy + y2 + 1 mod 5 1 2 3 4 A degree-d bivariate polynomial p:F x F -> F can be represented as 2|F| univariate degree-d polynomials (the “rows” and the columns”) 2x2 + xy + y2 + 1 mod 5 1 2 3 4 Y2+1 Y2+y+3 Y2+2y+4 Y2+3y+4 Y2+4y+3 2x2+1 2x2+x+2 2x2+2x 2x2+3x 2x2+4x+2

Bivariate Low-Degree Test Pick a random row and a random column. Chek that they agree on intersection If |F| is a constant factor bigger than d, then rejection probability is proportional to distance from code Arora-Safra, ALMSS, Polishuck-Spielman

Efficiency of Decoding vs Checking

Tensor Product Codes Suppose we have a linear code C with codewords in {0,1}^m. Define new code C’ with codewords in {0,1}^(mxm); a “matrix” is a codeword of C’ if each row and each column is codeword for C If C has lots of codeword and large minimum distance, same true for C’

Generalization of the Bivariate Low Degree Test Suppose C has K codewords Define code C’’ over alphabet [K], with codewords of length 2m C’’ has as many codewords as C’ For each codeword y of C’, corresponding codeword in C’’ contains value of each row and each column of y Test: pick a random “row” and a random “column”, check intersection agrees Analysis?

Negative Results? No known lower bound for locally checkable codes Possible to get encoding length n^(1+o(1)) and checking with O(1) queries and {0,1} alphabet? Possible to get encoding length O(n) with O(1) queries and small alphabet?

Applications? Better locally decodable codes have applications to PIR General/simple analysis of checkable proofs could have application to PCP (linear-length PCP, simple proof of the PCP theorem) Applications to the practice of fault-tolerant data storage/transmission?