Publication

Methods and systems for low-power and pin-efficient communications with superposition signaling codes

Publications associées (34)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Dynamically Orthogonal Approximation for Stochastic Differential Equations

Fabio Nobile, Yoshihito Kazashi, Fabio Zoccolan

In this paper, we set the mathematical foundations of the Dynamical Low Rank Approximation (DLRA) method for high-dimensional stochastic differential equations. DLRA aims at approximating the solution as a linear combination of a small number of basis vect ...

2023

Measurement in the Age of Information

Marilyne Andersen, Forrest Simon Webler

Information is the resolution of uncertainty and manifests itself as patterns. Although complex, most observable phenomena are not random and instead are associated with deterministic, chaotic systems. The underlying patterns and symmetries expressed from ...

2022

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

Alessandro Chiesa

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

SIAM PUBLICATIONS2022

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

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

EPFL2022

Symmetry in design and decoding of polar-like codes

Kirill Ivanov

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

EPFL2022

A methodology to design measurement systems when multiple model classes are plausible

Ian Smith, Numa Joy Bertola, Sai Ganesh Sarvotham Pai

The management of existing civil infrastructure is challenging due to evolving functional requirements, aging and climate change. Civil infrastructure often has hidden reserve capacity because of conservative approaches used in design and during constructi ...

2021

Recursive Projection-Aggregation Decoding of Reed-Muller Codes

Emmanuel Abbé, Min Ye

We propose a new class of efficient decoding algorithms for Reed-Muller (RM) codes over binary-input memoryless channels. The algorithms are based on projecting the code on its cosets, recursively decoding the projected codes (which are lower-order RM code ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Framework to Approximate the Value of Information of Bridge Load Testing for Reserve Capacity Assessment

Ian Smith, Numa Joy Bertola, Marco Proverbio

In developed countries, structural assessment of existing bridges should not be performed using the same conservative models that are used at the design stage. Field measurements of real behavior provide additional information for the inference of previous ...

2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

Bits through Time

Elie Najm

In any communication system, there exist two dimensions through which the information at the source becomes distorted before reaching the destination: the noisy channel and time. Messages transmitted through a noisy channel are susceptible to modification ...

EPFL2019