9 citations · 11 across the 4 of their papers we have counts for
6 papers · 1 filter
A Learning-Based Approach to Approximate Coded Computation
Navneet Agrawal, Yuqin Qiu, Matthias Frey +4
Lagrange coded computation (LCC) is essential to solving problems about matrix polynomials in a coded distributed fashion; nevertheless, it can only solve the problems that are rep…
Distributed Approximation of Functions over Fast Fading Channels with Applications to Distributed Learning and the Max-Consensus Problem
Igor Bjelakovic, Matthias Frey, Slawomir Stanczak
In this work, we consider the problem of distributed approximation of functions over multiple-access channels with additive noise. In contrast to previous works, we take fast fadin…
A Scalable Max-Consensus Protocol For Noisy Ultra-Dense Networks
Navneet Agrawal, Matthias Frey, Slawomir Stanczak
We introduce \emph{ScalableMax}, a novel communication scheme for achieving max-consensus in a network of multiple agents which harnesses the interference in the wireless channel a…
The MAC Resolvability Region, Semantic Security and Its Operational Implications
Matthias Frey, Igor Bjelakovic, Slawomir Stanczak
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel (MAC) from the perspective of reso…
MAC Resolvability: First And Second Order Results
Matthias Frey, Igor Bjelakovic, Slawomir Stanczak
Building upon previous work on the relation between secrecy and channel resolvability, we revisit a secrecy proof for the multiple-access channel from the perspective of resolvabil…
User Activity Detection via Group Testing and Coded Computation
Matthias Frey, Igor Bjelaković, Sławomir Stańczak
Inspired by group testing algorithms and the coded computation paradigm, we propose and analyze a novel multiple access scheme for detecting active users in large-scale networks. T…