Subspace properties of randomized network coding

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.

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

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...

This work addresses the problem of learning the topology of a network from the signals emitted by the network nodes. These signals are generated over time through a linear diffusion process, where neighboring nodes exchange messages according to the underl ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

Fluid antenna systems (FAS) are an emerging technology that promises a significant diversity gain even in the smallest spaces. It consists of a freely moving antenna in a small linear space to pick up the strongest received signal. Previous works in the li ...

Isogeometric analysis is a powerful paradigm which exploits the high smoothness of splines for the numerical solution of high order partial differential equations. However, the tensor-product structure of standard multivariate B-spline models is not well s ...

Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to so ...

Long Range (LoRa) is an emerging low-power wide-area network technology offering long-range wireless connectivity to Internet of Things (IoT) devices. For energy efficiency reasons, LoRa end nodes implement a nonslotted ALOHA multiple access scheme to tran ...

This work investigates the benefits of a two-layer adaptive signal control framework combining multi-region perimeter control (PC) with distributed Max Pressure (MP) control in selected network intersections. Motivated by MP’s questionable performance in o ...

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

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

Edge-based and face-based smoothed finite element methods (ES-FEM and FS-FEM, respectively) are modified versions of the finite element method allowing to achieve more accurate results and to reduce sensitivity to mesh distortion, at least for linear eleme ...

LoRaWAN is nowadays one of the most popular protocols for low-power Internet of Things communications. Although its physical layer, namely LoRa, has been thoroughly studied in the literature, aspects related to the synchronization of LoRa receivers have re ...

The convergence speed of machine learning models trained with Federated Learning is significantly affected by non-independent and identically distributed (non-IID) data partitions, even more so in a fully decentralized setting without a central server. In ...

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

Subspace properties of randomized network coding

Chat with Graph Search

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

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Global, Passive Detection of Connection Tampering

A Network Calculus Analysis of Asynchronous Mechanisms in Time-Sensitive Networks

Estimating the Topology of Preferential Attachment Graphs Under Partial Observability

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Get the Best of Both Worlds: Improving Accuracy and Transferability by Grassmann Class Representation

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems

A New Analytical Approximation of the Fluid Antenna System Channel

Adaptive isogeometric methods with C-1 (truncated) hierarchical splines on planar multi-patch domains

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

A Maximum-Likelihood-Based Two-User Receiver for LoRa Chirp Spread-Spectrum Modulation

Two-layer adaptive signal control framework for large-scale networks combining efficient Max-Pressure and Perimeter Control

TimeEvolver: A program for time evolution with improved error bound

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Quantization for Distributed Processing and Learning of Structured Data

An element-based formulation for ES-FEM and FS-FEM models for implementation in standard solid mechanics finite element codes for 2D and 3D static analysis

A Low-Complexity LoRa Synchronization Algorithm Robust to Sampling Time Offsets

D-Cliques: Compensating for Data Heterogeneity with Topology in Decentralized Federated Learning

A Functional Perspective on Information Measures