• Optimal Las Vegas reduction from one-way set reconciliation to error correction 

    Belazzougui, Djamal
    In : (Springer Varlag, 2016-03-28)
    Suppose we have two players A and C, where player A has a string s[0..u−1] and player C has a string t[0..u−1] and none of the two players knows the other's string. Assume that s and t are both over an integer alphabet [σ]=[0,σ−1], where the first string contains n non-zero entries. We would wish to answer the ...