A Simple Converse of Burnashev's Reliability Function

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.

The optical domain presents potential avenues for enhancing both computing and communication due to its inherent properties of bandwidth, parallelism, and energy efficiency. This research focuses on harnessing 3-Dimensional (3D) diffractive optics for nove ...

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

Displaced communication, whereby individuals communicate regarding a subject that is not immediately present (spatially or temporally), is one of the key features of human language. It also occurs in a few animal species, most notably the honeybee, where t ...

This paper presents a novel distributed approach for solving AC power flow (PF) problems. The optimization problem is reformulated into a distributed form using a communication structure corresponding to a hypergraph, by which complex relationships between ...

Spinal-cord injury interrupts communication between the brain and spinal cord, leading to paralysis. An implant that decodes the brain signals that control movements and drives electrical stimulation of the spinal cord re-establishes this communication, en ...

Environmental change is intensifying the biodiversity crisis and threatening species across the tree of life. Conservation genomics can help inform conservation actions and slow biodiversity loss. However, more training, appropriate use of novel genomic me ...

In this article, we consider decentralized optimization problems where agents have individual cost functions to minimize subject to subspace constraints that require the minimizers across the network to lie in low-dimensional subspaces. This constrained fo ...

Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless symmetric channels and are conjectured to have a comparable performance to that of random codes in terms of scaling laws. However, such results are established assuming maximum- ...

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

For people with limited mobility, navigating in cluttered indoor environment is challenging. In this work, we propose a mobile assistive furniture suite that is designed to ease the life of people with special needs in indoor movement. To enable intelligen ...

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 ...

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 ...

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 ...

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 ...

The widespread use of bots to support software development makes social coding platforms such as GitHub a particularly rich source of data for the study of human-bot interaction. Software development bots are used to automate repetitive tasks, interacting ...

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 ...

Locally correctable codes (LCCs) are error correcting codes C : \Sigmak \rightarrow \Sigman which admit local algorithms that correct any individual symbol of a corrupted codeword via a minuscule number of queries. For systematic codes, this notion is stro ...

In modular robotics, there is classically a compromise between coupling complexity and functionality. The mechanical and electrical designs are linked, such that adding electrical features often requires redesigning the mechanical components. However, incr ...

When humans interact with each other, eye gaze movements have to support motor control as well as communication. On the one hand, we need to fixate the task goal to retrieve visual information required for safe and precise action-execution. On the other ha ...

A Simple Converse of Burnashev's Reliability Function

Chat with Graph Search

3D diffractive optics for linear interconnects and nonlinear processing

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

The evolution of behavioral cues and signaling in displaced communication

Hypergraph-Based Fast Distributed AC Power Flow Optimization

A digital bridge between brain and spinal cord restores walking after paralysis

Genomics and conservation: Guidance from training to analyses and applications

Quantization for Decentralized Learning Under Subspace Constraints

Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Real-Time Localization for Closed-Loop Control of Assistive Furniture

A Functional Perspective on Information Measures

Symmetry in design and decoding of polar-like codes

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

Proofs, Circuits, and Communication

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

An Exploratory Study of Reactions to Bot Comments on GitHub

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

Relaxed Locally Correctable Codes With Nearly-Linear Block Length And Constant Query Complexity

3PAC: A Plug-and-Play System for Distributed Power Sharing and Communication in Modular Robots

The Gaze Dialogue Model: Nonverbal Communication in HHI and HRI