Exclusive-or computation on reconciled data
Kuupäev
2023
Autorid
Ajakirja pealkiri
Ajakirja ISSN
Köite pealkiri
Kirjastaja
Tartu Ülikool
Abstrakt
Assume there are two users. They both have some sets of binary vectors of length n and want to compute jointly exclusive-or on the union of their sets.
In the proof, we use the method of monochromatic rectangles, which was proposed in A.C. Yao, STOC, 1979. In addition, we establish a connection between the codewords of the Hamming code and sets that determine different monochromatic rectangles.
Kirjeldus
Märksõnad
kommunikatsioonikeerukus, hajusarvutus, Hammingi kood, välistav VÕI, distributed computing, Hamming code, exclusive or