Broadcast, relay and feedback in Gaussian channels

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Mobile network operators constantly have to upgrade their cellular network to satisfy the public's hunger for increasing data capacity. However, regulatory limits regarding allowed electromagnetic field strength on existing cell sites often limit or preven ...

Order, regularities, and patterns are ubiquitous around us. A flock of birds maneuvering in the sky, the self-organization of social insects, a global pandemic or a traffic jam are examples of complex systems where the macroscopic patterns arise from the m ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

In the domains of machine learning, data science and signal processing, graph or network data, is becoming increasingly popular. It represents a large portion of the data in computer, transportation systems, energy networks, social, biological, and other s ...

The Dolev-Reischuk bound says that any deterministic Byzantine consensus protocol has (at least) quadratic (in the number of processes) communication complexity in the worst case: given a system with n processes and at most f < n/3 failures, any solution t ...

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

Modular robots hold promise of adaptability, robustness, and versatility. Synchronization of modules is critical; if a module is asynchronous, not only will the robot fail to perform tasks properly, but its behavior may be self-destructive through self-col ...

The design of efficient energy systems, through the development of new technologies and the improvement of current ones, requires the use of rigorous process synthesis methods for generating and analysing design alternatives. We introduce a digital twin of ...

Alkynes and nitriles are valuable building blocks in organic synthesis and also have multiple applications in chemical biology and materials science. Due to the high availability of tertiary alcohols, developing methods for their conversion into alkynes an ...

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...

Aerial robot swarms have the potential to perform time-critical and dangerous tasks such as disaster response without compromising human safety. However, their reliance on external infrastructure such as global positioning for localization and wireless net ...

The Collision problem is to decide whether a given list of numbers (x_1,…,x_n) ∈ [n]ⁿ is 1-to-1 or 2-to-1 when promised one of them is the case. We show an n^Ω(1) randomised communication lower bound for the natural two-party version of Collision where Ali ...

In a group, the collective dynamics is governed by the inter- actions between individuals, which can manifest differently depending on the available means of communication. In this paper, we compare 3 conditions of communication affordances (global chat, l ...

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

Active Debris Removal missions consist of sending a satellite in space and removing one or more debris from their current orbit. A key challenge is to obtain information about the uncooperative target. By gathering the velocity, position, and rotation of t ...

Broadcast, relay and feedback in Gaussian channels

Chat with Graph Search

Beam Selection and Tracking for Amplify-and-Forward Repeaters

Human-Robot Swarm Interaction: An Explorative Path to Foster Complex Systems Understanding

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Quantization for Distributed Processing and Learning of Structured Data

Byzantine consensus is Θ(n^2): the Dolev-Reischuk bound is tight even in partial synchrony!

Symmetry in design and decoding of polar-like codes

Hybrid Wireless-Local Communication via Information Propagation for Modular Robotic Synchronization Applications

Overcoming decision paralysis—A digital twin for decision making in energy system design

Exploring Photoredox-Catalyzed (Re)functionalizations with Core-Modified Benziodoxolones

Oracular Byzantine Reliable Broadcast

Proofs, Circuits, and Communication

Vision-based Flocking in Aerial Robot Swarms

Communication Complexity of Collision

Effect of Different Communication Affordances on the Emergence of Collaboration Strategies in an Online Multiplayer Game

A Functional Perspective on Information Measures

Uncooperative Rendezvous in Space: Design of an Electronic Architecture for High Performance Avionic with Multi Sensor Input and Intensive Data Rate