Communication complexity of secure distributed computation in the presence of noise
From MaRDI portal
Publication:4014135
DOI10.1109/18.144700zbMath0775.94018OpenAlexW2127557559MaRDI QIDQ4014135
Anthony Ephremides, Eytan H. Modiano
Publication date: 11 October 1992
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.144700
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Communication theory (94A05) Distributed algorithms (68W15)
Related Items (2)
Privacy in non-private environments ⋮ Communication protocols for secure distributed computation of binary functions.
This page was built for publication: Communication complexity of secure distributed computation in the presence of noise