Download - Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Transcript
Page 1: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Near-Optimal Erasure List-Decodable Codes

Dean Doron (Tel-Aviv University)Workshop on Coding and Information Theory, CMSA

Joint work withAvi Ben-AroyaAmnon Ta-Shma

Page 2: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A code C : {0,1}n → {0,1}n̄ is (1-ε,L) erasure list-decodable, if

• Given a codeword

Erasure List-Decodable Codes

0 1 1 0 0 0 1 0 1 1

Page 3: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A code C : {0,1}n → {0,1}n̄ is (1-ε,L) erasure list-decodable, if

• Given a codeword where all but ε fraction of its coordinates were (adversarially) erased,

Erasure List-Decodable Codes

0 1 1 0 0 0 1 0 1 1

Page 4: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A code C : {0,1}n → {0,1}n̄ is (1-ε,L) erasure list-decodable, if

• Given a codeword where all but ε fraction of its coordinates were (adversarially) erased,

Erasure List-Decodable Codes

? 1 ? ? ? 0 1 ? ? 1

Page 5: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A code C : {0,1}n → {0,1}n̄ is (1-ε,L) erasure list-decodable, if

• Given a codeword where all but ε fraction of its coordinates were (adversarially) erased,

Erasure List-Decodable Codes

? 1 ? ? ? 0 1 ? ? 1

1 1 1 0 1 0 1 0 0 1

0 1 1 0 0 0 1 0 1 1

0 1 0 0 0 0 1 1 1 1

⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮

0 1 1 1 1 0 1 1 0 1

n̄there exists a list of size at most L that contains the original codeword.

Page 6: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A code C : {0,1}n → {0,1}n̄ is (1-ε,L) erasure list-decodable, if

• Given a codeword where all but ε fraction of its coordinates were (adversarially) erased,

Erasure List-Decodable Codes

? 1 ? ? ? 0 1 ? ? 1

1 1 1 0 1 0 1 0 0 1

0 1 1 0 0 0 1 0 1 1

0 1 0 0 0 0 1 1 1 1

⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮ ⋮

0 1 1 1 1 0 1 1 0 1

n̄there exists a list of size at most L that contains the original codeword.

Page 7: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We work over the binary field.

• The two key parameters:

• The code’s rate R = n̄/n.

• The list-size L.

Bounds for the binary case

Page 8: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Bounds on the rate

Page 9: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The code’s rate — R.

Bounds on the rate

Page 10: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The code’s rate — R.

• Can be as large as ε [Guruswami 03] (recall that ε is the fraction of coordinates we keep).

• Compare with the errors model, where ~ ε2 is necessary for a code of distance ½ - ε.

Bounds on the rate

Page 11: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Bounds on the list-size

Page 12: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The list-size — L.

Bounds on the list-size

Page 13: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The list-size — L.

• Can be as tiny as log(1/ε) [Guruswami 03].

• Compare with the errors model, where poly(1/ε) is necessary.

Bounds on the list-size

Page 14: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The list-size — L.

• Can be as tiny as log(1/ε) [Guruswami 03].

• Compare with the errors model, where poly(1/ε) is necessary.

• For linear codes, the list-size is at least 1/ε [Guruswami 03].

Bounds on the list-size

Page 15: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Previous Results

Page 16: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Any binary code of distance ½ - ε can handle 1-2ε erasures with polynomial list size.

Previous Results

Page 17: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Any binary code of distance ½ - ε can handle 1-2ε erasures with polynomial list size.

• Drawback: We have upper bounds. Cannot break the rate-ε2 bound that way [MRRW,…].

Previous Results

Page 18: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Any binary code of distance ½ - ε can handle 1-2ε erasures with polynomial list size.

• Drawback: We have upper bounds. Cannot break the rate-ε2 bound that way [MRRW,…].

• Few explicit constructions (especially for binary codes).

Previous Results

Page 19: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Previous Results

Rate R List-Size L

Non-explicit ε log(1/ε)

Optimal codes with distance ½-ε ε2 poly(1/ε)

Guruswami 01 (constant ε) ε2/log(1/ε) 1/ε

Guruswami-Indyk 03 (constant ε) ε2/log(1/ε) log(1/ε)

Page 20: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• In the small ε regime, we break the ε2 barrier, and manage to do this with nearly optimal parameters.

Our Result

Page 21: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• In the small ε regime, we break the ε2 barrier, and manage to do this with nearly optimal parameters.

Our Result

For every small enough ε and a constant γ there exists an explicit binary erasure list-decodable code with rate

R = ε1+ γ

and list-size

L = poly(log(1/ε))

Page 22: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Previous Results

Rate R List-Size L

Non-explicit ε log(1/ε)

Optimal codes with distance ½-ε ε2 poly(1/ε)

Guruswami 01 (constant ε) ε2/log(1/ε) 1/ε

Guruswami-Indyk 03 (constant ε) ε2/log(1/ε) log(1/ε)

Our Result(small ε) ε1+γ poly(log(1/ε))

Page 23: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Guruswami 04]

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

Page 24: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Guruswami 04]

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

Page 25: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Guruswami 04]

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

Page 26: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Guruswami 04]

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

Page 27: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Guruswami 04]

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

Page 28: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

Disp(x,y)

{0,1}

D=2dx

Page 29: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• For every (n,k)-source X, or a set X⊆{0,1}n of size at least K=2k,

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

X Disp(x,y)

{0,1}

D=2dx

Page 30: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• For every (n,k)-source X, or a set X⊆{0,1}n of size at least K=2k,

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

X

For every x, Pr[X = x] ≤ 2-k.

Disp(x,y)

{0,1}

D=2dx

Page 31: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• For every (n,k)-source X, or a set X⊆{0,1}n of size at least K=2k,

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

X Disp(x,y)

{0,1}

D=2dx

Page 32: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• For every (n,k)-source X, or a set X⊆{0,1}n of size at least K=2k,

• For all but ε-fraction of the seeds y∈{0,1}d,

Disp(X,y) = {0,1}

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

X Disp(x,y)

{0,1}

D=2dx

Page 33: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• For every (n,k)-source X, or a set X⊆{0,1}n of size at least K=2k,

• For all but ε-fraction of the seeds y∈{0,1}d,

Disp(X,y) = {0,1}

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

XDisp(x1,ybad)=1

Disp(xK,ybad)=1

{0,1}

Page 34: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• For every (n,k)-source X, or a set X⊆{0,1}n of size at least K=2k,

• For all but ε-fraction of the seeds y∈{0,1}d,

Disp(X,y) = {0,1}

1-bit Strong Dispersers

Disp: {0,1}n × {0,1}d →{0,1}

{0,1}n

0

1

X

Disp(x1,y)=0

Disp(xK,y)=1

{0,1}

Page 35: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Bounds for1-bit Strong Dispersers

Page 36: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Dispersers are an important tool in derandomization.

Bounds for1-bit Strong Dispersers

Page 37: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Dispersers are an important tool in derandomization.

• The two key parameters:

Bounds for1-bit Strong Dispersers

Page 38: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Dispersers are an important tool in derandomization.

• The two key parameters:

• The disperser’s seed length — d.

• The disperser’s entropy requirement — k (or, how small can X be).

Bounds for1-bit Strong Dispersers

Page 39: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Bounds on the seed length

Page 40: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The disperser’s seed length — d.

Bounds on the seed length

Page 41: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The disperser’s seed length — d.

• Can be as small as log(n)+log(1/ε) [Radhakrishnan,Ta-Shma 00, Meka,Reingold,Zhou 14].

Bounds on the seed length

Page 42: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Bounds on the entropy

Page 43: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The disperser’s entropy requirement — k (or, how small can X be).

• Can be as tiny as loglog(1/ε). That is, an optimal disperser works for extremely small sets — of size O(log(1/ε)) [Radhakrishnan,Ta-Shma 00, Meka,Reingold,Zhou 14].

Bounds on the entropy

Page 44: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Comparison with extractors

Page 45: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Dispersers’ parameters outperform seeded extractors, in which we don’t only require that the output covers the entire codomain, but also require doing it uniformly.

• The seed length must be at least log(n)+2log(1/ε) [Radhakrishnan,Ta-Shma 00] (compare with log(n)+log(1/ε) for dispersers).

• The entropy requirement must be at least 2log(1/ε) [Radhakrishnan,Ta-Shma 00] (compare with loglog(1/ε) for dispersers).

Comparison with extractors

Page 46: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

[Guruswami 04]

Page 47: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Codes from Dispersers

Page 48: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Codes from DispersersIf Disp: {0,1}n × {0,1}d →{0,1} has error ε and entropy requirement k, we can explicitly construct a code C: {0,1}n → {0,1}D for D=2d that is erasure list-decodable from 1-2ε erasures with list-size L = 2k and rate R=n/D.

Page 49: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Codes from DispersersIf Disp: {0,1}n × {0,1}d →{0,1} has error ε and entropy requirement k, we can explicitly construct a code C: {0,1}n → {0,1}D for D=2d that is erasure list-decodable from 1-2ε erasures with list-size L = 2k and rate R=n/D.

Taking an optimal disperser with d=log(n)+log(1/ε) and k=loglog(1/ε), we get an optimal erasure list-decodable code with rate R=n/D=ε and list-size L=2k=log(1/ε).

Page 50: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Constructing Dispersers

Page 51: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• How can we construct small-error 1-bit strong dispersers?

Constructing Dispersers

Page 52: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• How can we construct small-error 1-bit strong dispersers?

• We need all but ε-fraction of the seeds to cover {0,1}.

• We don’t want to do it uniformly (this would give an extractor).

• Say, typically, Disp(X,y) is ε0-close to uniform for ε0 ≫ ε (say, ε0 = ¼).

Constructing Dispersers

Page 53: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Different Perspectives

Erasure List-

Decodable Codes

Ramsey Graphs

Strong 1-bit

Dispersers

[Gradwohl, Kindler, Reingold, Ta-Shma 05]

[Guruswami 04]

2-Source Extractors

Page 54: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Two-Source Extractors

{0,1}n

X

{0,1}d

Y

edge ↔ 2Ext = 1

2Ext: {0,1}n × {0,1}d →{0,1}

Page 55: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Two-Source Extractors

{0,1}n

X

• For every (n,k)-source X,

• For every (d,d’)-source Y, independent of X,

• 2Ext(X,Y) is ε0-close to uniform (think ε0 of as constant). {0,1}d

Y

edge ↔ 2Ext = 1

2Ext: {0,1}n × {0,1}d →{0,1}

Page 56: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Two-Source Extractors

{0,1}n

X

[2d]

|Y|=2d’

edge ↔ 2Ext = 1

2Ext: {0,1}n × {0,1}d →{0,1}

Page 57: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Two-Source Extractors

{0,1}n

X

• The error of the corresponding strong disperser (the faction of bad seeds) is given by ε = 2d’-d.

[2d]

|Y|=2d’

edge ↔ 2Ext = 1

2Ext: {0,1}n × {0,1}d →{0,1}

Page 58: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Implications of Two-Source Extractors

Page 59: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• By constructing two-source extractors for an (n,k)-source and a (d,d’=γd) source, we get:

Implications of Two-Source Extractors

Page 60: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• By constructing two-source extractors for an (n,k)-source and a (d,d’=γd) source, we get:

• A strong disperser for entropy k and seed-length d=(1/(1-γ))log(1/ε).

Implications of Two-Source Extractors

Page 61: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• By constructing two-source extractors for an (n,k)-source and a (d,d’=γd) source, we get:

• A strong disperser for entropy k and seed-length d=(1/(1-γ))log(1/ε).

• An erasure list-decodable code of list-size L=2k and rate R=ε1/(1-γ).

Implications of Two-Source Extractors

Page 62: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• By constructing two-source extractors for an (n,k)-source and a (d,d’=γd) source, we get:

• A strong disperser for entropy k and seed-length d=(1/(1-γ))log(1/ε).

• An erasure list-decodable code of list-size L=2k and rate R=ε1/(1-γ).

Implications of Two-Source Extractors

So we must achieve γ<½ to break the ε2 bound!

Page 63: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• By constructing two-source extractors for an (n,k)-source and a (d,d’=γd) source, we get:

• A strong disperser for entropy k and seed-length d=(1/(1-γ))log(1/ε).

• An erasure list-decodable code of list-size L=2k and rate R=ε1/(1-γ).

Implications of Two-Source Extractors

Page 64: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Our Goal

Page 65: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are given an (n,k)-source X and an independent (d,d’=γd)-source Y. We want to extract one unbiased bit.

Our Goal

γdY

kX

Page 66: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are given an (n,k)-source X and an independent (d,d’=γd)-source Y. We want to extract one unbiased bit.

• For γ>½, the problem was already solved.

Our Goal

γdY

kX

Page 67: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Our Goal

Page 68: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are given an (n,k)-source X and an independent (d,d’=γd)-source Y. We want to extract one unbiased bit.

• For γ>½, the problem was already solved.

• Raz [Raz 05] gave a construction that supports, say, γ=0.6. In such a case, Raz(X,Y) is very close to uniform.

Our Goal

Page 69: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are given an (n,k)-source X and an independent (d,d’=γd)-source Y. We want to extract one unbiased bit.

• For γ>½, the problem was already solved.

• Raz [Raz 05] gave a construction that supports, say, γ=0.6. In such a case, Raz(X,Y) is very close to uniform.

• In the code sense, it gives a list-size of poly(log(1/ε)).

Our Goal

Page 70: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are given an (n,k)-source X and an independent (d,d’=γd)-source Y. We want to extract one unbiased bit.

• For γ>½, the problem was already solved.

• Raz [Raz 05] gave a construction that supports, say, γ=0.6. In such a case, Raz(X,Y) is very close to uniform.

• In the code sense, it gives a list-size of poly(log(1/ε)).

• But, γ>½ so we cannot break the rate ε2 bound.

Our Goal

Page 71: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Our Goal

Page 72: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are given an (n,k)-source X and an independent (d,d’=γd)-source Y. We want to extract one unbiased bit.

Our Goal

γdY

kX

Page 73: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Condensing Y

Page 74: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We want to:

• Condense Y. From a (d,γd)-source to an (m,0.6m)-source.

Condensing Y

γdY

kX

Condenser

Page 75: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We want to:

• Condense Y. From a (d,γd)-source to an (m,0.6m)-source.

• To apply Raz’s extractor.

Condensing Y

γdY

kX

Condenser

Page 76: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Seeded Condensers

Page 77: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We need Cond: {0,1}d × {0,1}s →{0,1}m that increases the density of the source to rate 0.6.

Seeded Condensers

Page 78: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We need Cond: {0,1}d × {0,1}s →{0,1}m that increases the density of the source to rate 0.6.

• To apply Cond, we need a uniform seed Us. How do we get it?

Seeded Condensers

Page 79: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We need Cond: {0,1}d × {0,1}s →{0,1}m that increases the density of the source to rate 0.6.

• To apply Cond, we need a uniform seed Us. How do we get it?

• Option 1 — Use another independent source.

Seeded Condensers

Page 80: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We need Cond: {0,1}d × {0,1}s →{0,1}m that increases the density of the source to rate 0.6.

• To apply Cond, we need a uniform seed Us. How do we get it?

• Option 1 — Use another independent source.

• Option 2 — Enumerate over all possible seeds. This gives us a table Y’.

Seeded Condensers

Page 81: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Condensing Y

γdY

kX

Condenser

Cond(Y,s1)Cond(Y,s2)

Cond(Y,si)

Cond(Y,sA)

Y’

Page 82: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Seeded Condensers

Page 83: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The number of rows of Y’ is the number of possible seeds of the condenser.

Seeded Condensers

Page 84: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The number of rows of Y’ is the number of possible seeds of the condenser.

• Composing existing constructions, we have an explicit condenser having a constant number of seeds! This fact is crucial for us [Dvir,Kopparty,Saraf,Sudan 13, Zuckerman 06].

Seeded Condensers

Page 85: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The number of rows of Y’ is the number of possible seeds of the condenser.

• Composing existing constructions, we have an explicit condenser having a constant number of seeds! This fact is crucial for us [Dvir,Kopparty,Saraf,Sudan 13, Zuckerman 06].

• More specifically, the seed length of the condenser is s=O(log(1/εcond)) and we apply it with a constant εcond.

Seeded Condensers

Page 86: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The number of rows of Y’ is the number of possible seeds of the condenser.

• Composing existing constructions, we have an explicit condenser having a constant number of seeds! This fact is crucial for us [Dvir,Kopparty,Saraf,Sudan 13, Zuckerman 06].

• More specifically, the seed length of the condenser is s=O(log(1/εcond)) and we apply it with a constant εcond.

• Y’ is still only a function of Y.

Seeded Condensers

Page 87: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Condensing Y

γdY

kX

Condenser

~0.6d

Cond(Y,si)

Y’

Page 88: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Applying Raz’s extractor

Page 89: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Most of the rows of Y’ are good — they have large density.

• We can now apply Raz’s extractor.

• X as the source.

• Every row of Y’ as the seed.

Applying Raz’s extractor

Page 90: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Applying Raz’s extractor

γdY

kX

Condenser

~0.6d

Cond(Y,si)

Y’

Extractor

~U

Raz(X,Y’i)

Y’’

Page 91: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Applying Raz’s extractor

Page 92: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We now have that most of the rows of Y’’ are uniform and there is a small set of bad rows.

Applying Raz’s extractor

Page 93: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We now have that most of the rows of Y’’ are uniform and there is a small set of bad rows.

• That’s not enough for us — we need to output a single good value.

Applying Raz’s extractor

Page 94: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We now have that most of the rows of Y’’ are uniform and there is a small set of bad rows.

• That’s not enough for us — we need to output a single good value.

• The solution (in the spirit of [Chattopadhyay,Zuckerman 16])

• Apply a resilient function on the rows of Y’’.

Applying Raz’s extractor

Page 95: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Resilient Functions

Page 96: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• What do we need from a resilient function?

Resilient Functions

Page 97: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• What do we need from a resilient function?

• Nearly balanced.

• Its output cannot be heavily influenced by any small set of bad rows.

Resilient Functions

Page 98: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• What do we need from a resilient function?

• Nearly balanced.

• Its output cannot be heavily influenced by any small set of bad rows.

• For example, the Majority function is a resilient function.

Resilient Functions

Page 99: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Resilient Functions

Page 100: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Resilient Functions

• That approach is problematic…

Page 101: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Resilient Functions

• That approach is problematic…

• Even if there is only one bad row, the Majority function can still fail!

~U~U~U~U~U~U

Y’’1 = ¬Y’’2

Ext(X,Y’i)Y’’3 = ¬Y’’4

Page 102: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Resilient Functions

Page 103: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• How can we fix this?

Resilient Functions

Page 104: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• How can we fix this?

• The Majority function will work if the good rows are not only uniform, but uniform and 10-wise independent [Viola 14].

Resilient Functions

Page 105: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• How can we fix this?

• The Majority function will work if the good rows are not only uniform, but uniform and 10-wise independent [Viola 14].

• So, before applying a resilient function, we need to (partially) break the correlations in Y’’.

Resilient Functions

Page 106: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• How can we fix this?

• The Majority function will work if the good rows are not only uniform, but uniform and 10-wise independent [Viola 14].

• So, before applying a resilient function, we need to (partially) break the correlations in Y’’.

• For that, we use a correlation breaker.

Resilient Functions

Page 107: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Correlation Breakers

Page 108: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We think of a 10-wise correlation breaker as an extractor, with the added property that its output on 10 distinct good seeds is (very close to) 10-wise independent.

Correlation Breakers

Page 109: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We think of a 10-wise correlation breaker as an extractor, with the added property that its output on 10 distinct good seeds is (very close to) 10-wise independent.

• Cohen’s correlation breaker [Cohen 16] allows for almost optimal parameters when the overall number of rows is constant.

Correlation Breakers

Page 110: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Correlation Breakers

Page 111: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A correlation breaker requires a source and an independent seed.

Correlation Breakers

Page 112: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A correlation breaker requires a source and an independent seed.

• We use every row of Y’’, and for the seed we reuse our Y.

Correlation Breakers

Page 113: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A correlation breaker requires a source and an independent seed.

• We use every row of Y’’, and for the seed we reuse our Y.

• The source and the seed are not independent… Y’’ is a function of both X and Y.

Correlation Breakers

Page 114: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A correlation breaker requires a source and an independent seed.

• We use every row of Y’’, and for the seed we reuse our Y.

• The source and the seed are not independent… Y’’ is a function of both X and Y.

• A main part of the analysis — show that we’re still OK.

Correlation Breakers

Page 115: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• A correlation breaker requires a source and an independent seed.

• We use every row of Y’’, and for the seed we reuse our Y.

• The source and the seed are not independent… Y’’ is a function of both X and Y.

• A main part of the analysis — show that we’re still OK.

• This gives a large set of good rows, every 10 of them are jointly close to uniform.

Correlation Breakers

Page 116: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• The correlation breaker outputs one bit.

• Every 10 good rows are jointly very close to uniform.

Applying a correlation breaker

~U

Ext(X,Y’i)

Y’’ = f(X,Y)

γdY

Correlation

CB(Y,Y’’i)

Y’’’

Breaker

Page 117: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are now ready to apply a resilient function!

Applying a resilient function

~U

Ext(X,Y’i)

Y’’ = f(X,Y)

γdY

Correlation

CB(Y,Y’’i)

Y’’’

Breaker

Page 118: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We are now ready to apply a resilient function!

Applying a resilient function

~U

Ext(X,Y’i)

Y’’ = f(X,Y)

γdY

Correlation

CB(Y,Y’’i)

Y’’’

Breaker

Resilient

FunctionU1

Page 119: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Overview

γdY

kX

Condenser

~0.6d

Cond(Y,si)

Y’

Extractor

~U

Raz(X,Y’i)

Y’’

Correlation

CB(Y,Y’’i)Breaker

Y’’’

U1

ResilientFunction

Constantbias ε0

Page 120: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Wrapping-Up

Page 121: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Given an (n,k)-source X and a (d,d’=γd) source Y, we extracted one bit with an arbitrarily small constant error.

Wrapping-Up

Page 122: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Given an (n,k)-source X and a (d,d’=γd) source Y, we extracted one bit with an arbitrarily small constant error.

• k can be extremely small — Ω(loglog(n)). Corresponds to a small list-size of our erasure list-decodable code.

Wrapping-Up

Page 123: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Given an (n,k)-source X and a (d,d’=γd) source Y, we extracted one bit with an arbitrarily small constant error.

• k can be extremely small — Ω(loglog(n)). Corresponds to a small list-size of our erasure list-decodable code.

• d can be small — Ω(log(n)), and the entropy-rate γ is an arbitrary constant. Corresponds to the large rate of our code.

Wrapping-Up

Page 124: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Given an (n,k)-source X and a (d,d’=γd) source Y, we extracted one bit with an arbitrarily small constant error.

• k can be extremely small — Ω(loglog(n)). Corresponds to a small list-size of our erasure list-decodable code.

• d can be small — Ω(log(n)), and the entropy-rate γ is an arbitrary constant. Corresponds to the large rate of our code.

• In this, unbalanced, regime of parameters, our two-source construction is close to optimal.

Wrapping-Up

Page 125: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Our Result

Page 126: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Our Result

For every small enough ε and a constant γ there exists an explicit binary erasure list-decodable code with rate

R = ε1+ γ

and list-size

L = poly(log(1/ε))

Page 127: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• We skipped over many delicate details which are crucial for our construction to work. Examples are:

• Reusing the source Y.

• Errors cannot be aggregated, but must be handled with care (e.g., separating errors that depend on the number of rows and errors that depend on the row’s length).

• Handling a set of bad rows that depend on the samples and not only on the distributions.

• The resilient function cannot be Majority and we need to achieve t-wise independence for a large t.

Wrapping-Up

Page 128: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

• Efficient list-decoding?

• Achieving linear erasure list-decodable codes that beat the rate ε2 bound (they would necessarily have a larger list-size).

• Getting even closer to optimal codes…

• Obtaining strong dispersers outputting many bits.

Open Questions

Page 129: Near-Optimal Erasure List- Decodable Codescmsa.fas.harvard.edu/wp-content/uploads/2016/12/ELDC_Harvard.pdf · Near-Optimal Erasure List-Decodable Codes Dean Doron (Tel-Aviv University)

Thanks for listening.