Exclusive-or computation on reconciled data
| dc.contributor.advisor | Skachek, Vitaly, juhendaja | |
| dc.contributor.advisor | Riet, Ago-Erik, juhendaja | |
| dc.contributor.author | Oksner, Kristiina | |
| dc.contributor.other | Tartu Ülikool. Matemaatika ja statistika instituut | et |
| dc.contributor.other | Tartu Ülikool. Loodus- ja täppisteaduste valdkond | et |
| dc.date.accessioned | 2023-06-29T12:35:58Z | |
| dc.date.available | 2023-06-29T12:35:58Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | 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. | |
| dc.identifier.uri | https://hdl.handle.net/10062/91160 | |
| dc.language.iso | eng | et |
| dc.publisher | Tartu Ülikool | et |
| dc.rights | openAccess | et |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | kommunikatsioonikeerukus | et |
| dc.subject | hajusarvutus | et |
| dc.subject | Hammingi kood | et |
| dc.subject | välistav VÕI | et |
| dc.subject | distributed computing | en |
| dc.subject | Hamming code | en |
| dc.subject | exclusive or | en |
| dc.subject.other | bakalaureusetööd | et |
| dc.subject.other | võrguväljaanded | et |
| dc.subject.other | communication complexity | en |
| dc.subject.other | suhtluskeerukus | et |
| dc.title | Exclusive-or computation on reconciled data | en |
| dc.type | Thesis | en |