Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Ran Gelles"'
Publikováno v:
Algorithms, Vol 2, Iss 2, Pp 790-807 (2009)
The theoretical Quantum Key-Distribution scheme of Bennett and Brassard (BB84) has been proven secure against very strong attacks including the collective attacks and the joint attacks. Though the latter are the most general attacks, collective attac
Externí odkaz:
https://doaj.org/article/cede052c8b5041aba33a5b0f3497693a
Publikováno v:
IEEE Transactions on Information Theory. 68:4723-4749
Publikováno v:
IEEE Transactions on Information Theory. 67:3411-3437
In the field of interactive coding, two or more parties wish to carry out a distributed computation over a communication network that may be noisy. The ultimate goal is to develop efficient coding schemes that can tolerate a high level of noise while
Publikováno v:
SIAM Journal on Discrete Mathematics. 34:904-937
Autor:
Ran Gelles, Manuj Mukherjee
Publikováno v:
ITW
Publikováno v:
PODC
Studying distributed computing through the lens of algebraic topology has been the source of many significant breakthroughs during the last two decades, especially in the design of lower bounds or impossibility results for deterministic algorithms. I
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa4c79944ef9555594e957d3166e52e2
http://arxiv.org/abs/2105.11713
http://arxiv.org/abs/2105.11713
Autor:
Manuj Mukherjee, Ran Gelles
We consider computations over networks with multiple broadcast channels that intersect at a single party. Each broadcast link suffers from random bit-flip noise that affects the receivers independently. We design interactive coding schemes that succe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d795c9ebe84a560dbf1551f9d9b29930
http://arxiv.org/abs/2105.01506
http://arxiv.org/abs/2105.01506
Autor:
Ran Gelles, Yael Tauman Kalai
Publikováno v:
IEEE Transactions on Information Theory. 65:3812-3829
Multiparty interactive coding allows a network of $n$ parties to perform distributed computations when the communication channels suffer from noise. Previous results (Rajagopalan and Schulman, STOC 1994) obtained a multiparty interactive coding proto
Publikováno v:
PODC
We introduce noisy beeping networks, where nodes have limited communication capabilities, namely, they can only emit energy or sense the channel for energy. Furthermore, imperfections may cause devices to malfunction with some fixed probability when
Publikováno v:
IEEE Transactions on Information Theory. 64:6546-6560
We show an explicit (that is, efficient and deterministic) capacity approaching interactive coding scheme that simulates any interactive protocol under random errors with nearly optimal communication rate. Specifically, over the binary symmetric chan