Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with beeping channel:
TR22-174 | 23rd November 2022
Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena

Noisy Radio Network Lower Bounds Via Noiseless Beeping Lower Bounds

Revisions: 2

Much of today's communication is carried out over large wireless systems with different input-output behaviors. In this work, we compare the power of central abstractions of wireless communication through the general notion of boolean symmetric $f$-channels: In every round of the $f$-channel, each of its $n$ parties decides to either ... more >>>

ISSN 1433-8092 | Imprint