Publication

On Distributed Successive Refinement with Lossless Recovery

Publications associées (35)

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

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

Entropy in Spin Relaxation, Spintronics, and Magnetic Resonance

Ferenc Simon

The entropy change during spin relaxation for a realistic model system is studied, whose spin dynamics can be handled with the Boltzmann equation. The time evolution of the von Neumann entropy is monitored during the process and is compared with the recent ...

WILEY-V C H VERLAG GMBH2020

Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding

Michael Christoph Gastpar, Sung Hoon Lim, Jingge Zhu

Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that ...

2019

Entropy as a tool for crystal discovery

Pablo Miguel Piaggi

The computational prediction of crystal structures has emerged as an useful alternative to expensive and often cumbersome experiments. We propose an approach to the prediction of crystal structures and polymorphism based on reproducing the crystallization ...

EPFL2019

A joint typicality approach to compute-forward

Michael Christoph Gastpar, Sung Hoon Lim, Chen Feng

A general framework for analyzing linear codes with joint typicality encoders and decoders is presented. Using this approach, we provide a new perspective on the compute-forward framework. In particular, an achievable rate region for computing the weighted ...

2015

Monotonicity of quantum relative entropy and recoverability

Marius Christopher Lemm

The relative entropy is a principal measure of distinguishability in quantum information theory, with its most important property being that it is non-increasing with respect to noisy quantum operations. Here, we establish a remainder term for this inequal ...

2015

Quantifying snowfall and avalanche release synchronization: a case study

Paolo Perona, Benoît Crouzy, Betty Sovilla, Romain Forclaz

We quantify the synchronization between snowfall and natural avalanches in relation to terrain properties at the detachment zone. We analyze field statistics of 549 avalanche events in terms of slope, aspect, timing, coordinate, and release area, identifie ...

Wiley-Blackwell2015

Various aspects of the built environment have important effects on ecology. Providing suitable metrics for the built forms so as to quantify and model their internal relations and external ecological footprints, however, remains a challenge. Here we provid ...

Elsevier2015

A New Entropy Power Inequality for Integer-Valued Random Variables

Emmanuel Abbé, Saeid Haghighatshoar

The entropy power inequality (EPI) yields lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have been obtained for spe ...

Institute of Electrical and Electronics Engineers2014

Data Compression via Logic Synthesis

Giovanni De Micheli, Andreas Peter Burg, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Nowadays, most software and hardware applications are committed to reduce the footprint and resource usage of data. In this general context, lossless data compression is a beneficial technique that encodes information using fewer (or at most equal number o ...

2014