Publication

Universal Source Polarization and Spare Recovery

Related publications (36)

Graph Chatbot

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.

A New Coding Paradigm for the Primitive Relay Channel

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

We consider the primitive relay channel, where the source sends a message to the relay and to the destination, and the relay helps the communication by transmitting an additional message to the destination via a separate channel. Two well-known coding tech ...

2019

Fully Quantized Distributed Gradient Descent

n major distributed optimization system, the main bottleneck is often the communication between the different machines. To reduce the time dedicated to communications, some heuristics have been developed to reduce the precision of the messages sent and hav ...

2017

Is conventional knowledge enough? Playing the devil's advocate in the adoption of digital fabrication technology

Paolo Tombesi, Sofia Colabella

Building on the research on the industrial potential of digital fabrication technologies commenced by the late University of Melbourne academic, Professor Bharat Dave, this paper explores actual patterns of technological adoption within communities of prac ...

The Association for Computer-Aided Architectural Design Research in Asia (CAADRIA)2016

Approaching the Rate-Distortion Limit With Spatial Coupling, Belief Propagation, and Decimation

Nicolas Macris, Vahid Aref, Marc Vuffray

We investigate an encoding scheme for lossy compression of a binary symmetric source based on simple spatially coupled low-density generator-matrix codes. The degree of the check nodes is regular and the one of code-bits is Poisson distributed with an aver ...

Institute of Electrical and Electronics Engineers2015

TDOA Matrices: Algebraic Properties and their Application to Robust Denoising with Missing Data

Afsaneh Asaei

Measuring the Time delay of Arrival (TDOA) between a set of sensors is the basic setup for many applications, such as localization or signal beamforming. This paper presents the set of TDOA matrices, which are built from noise-free TDOA measurements, not r ...

Institute of Electrical and Electronics Engineers2015

Data compression to define information content of hydrological time series

Marc Parlange, Steven Vincent Weijs, Nicolaas Cornelis van de Giesen

When inferring models from hydrological data or calibrating hydrological models, we are interested in the information content of those data to quantify how much can potentially be learned from them. In this work we take a perspective from (algorithmic) inf ...

Copernicus Gesellschaft Mbh2013

Distributed Compressed Representation of Correlated Image Sets

Vijayaraghavan Thirumalai

Vision sensor networks and video cameras find widespread usage in several applications that rely on effective representation of scenes or analysis of 3D information. These systems usually acquire multiple images of the same 3D scene from different viewpoin ...

EPFL2012

Crowdsourcing As A Solution To Distant Search

Christopher Tucci, Allan Afuah

We argue that under certain circumstances crowdsourcing transforms distant search into local search, improving the efficiency and effectiveness of problem solving. Under such circumstances a firm may choose to crowdsource problem solving rather than solve ...

Academy of Management2012

Polar Coding Theorems for Discrete Systems

Eren Sasoglu

Polar coding is a recently invented technique for communication over binary-input memoryless channels. This technique allows one to transmit data at rates close to the symmetric-capacity of such channels with arbitrarily high reliability, using low-complex ...

EPFL2011

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete mem ...

Institute of Electrical and Electronics Engineers2010