Publication

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Publications associées (41)

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

Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...

Jerusalem2023

Character of Electronic States in the Transport Gap of Molecules on Surfaces

Klaus Kern, Abhishek Grewal

We report on scanningtunneling microscopy (STM) topographs ofindividual metal phthalocyanines (MPc) on a thin salt (NaCl) filmadsorbed on a gold substrate, at tunneling energies within the molecule'selectronic transport gap. Theoretical models of increasin ...

AMER CHEMICAL SOC2023

A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice ...

2022

This paper develops high-order accurate entropy stable (ES) adaptive moving mesh finite difference schemes for the two- and three-dimensional special relativistic hydrodynamic (RHD) and magnetohydrodynamic (RMHD) equations, which is the high-order accurate ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2022

, , ,

Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

Consider the important special case of the K-user distributed source coding problem where the decoder only wishes to recover one or more linear combinations of the sources. The work of Körner and Marton demonstrated that, in some cases, the optimal rate re ...

2019

On The Move: Localization With Kinetic Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Puoya Tabaghi

In this paper, we propose kinetic Euclidean distance matrices (KEDMs) a new algebraic tool for localization of moving points from spatio temporal distance measurements. KEDMs are inspired by the well-known Euclidean distance matrices (EDM) which model stat ...

IEEE2019

A Joint Typicality Approach to Compute–Forward

Michael Christoph Gastpar, Sung Hoon Lim, Adriano Pastore, Chen Feng

This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute–forward within the context of discrete memoryless networks. In particular, it establ ...

2018

Using torsion theory to compute the algebraic structure of Hochschild (co)homology

The aim of this article is to provide explicit formulas for the cup product on the Hochschild cohomology of any nonnegatively graded connected algebra and for the cap products on the Hochschild homology of with coefficients in any graded bimodule at the le ...

2018

Mapping Monotone Boolean Functions into Majority

Giovanni De Micheli, Mathias Soeken, Luca Gaetano Amarù, Eleonora Testa, Winston Jason Haaswijk

We consider the problem of decomposing monotone Boolean functions into majority-of-three operations, with a particular focus on decomposing the majority-n function. When targeting monotone Boolean functions, Shannon's expansion can be expressed by a single ...

2018