Publication

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

Related publications (44)

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.

Active topology inference using network coding

Christina Fragouli

Our goal, in this paper, is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition ...

2013

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

Network Coding

Mahdi Jafari Siavoshani

The demand for higher throughput and better efficiency are two important challenges for future communication networks. During the past decades, a lot of research studies have been devoted to investigating and proposing near optimal and efficient schemes an ...

EPFL2012

Subspace properties of network coding and their applications

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the space spanned by th ...

2012

Invertible Extractors and Wiretap Protocols

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

A wiretap protocol is a pair of randomized encoding and decoding functions such that knowledge of a bounded fraction of the encoding of a message reveals essentially no information about the message, while knowledge of the entire encoding reveals the messa ...

2012

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

Network coding of correlated data with approximate decoding

Pascal Frossard, Nikolaos Thomos, Hyung Gon Park

We consider the problem of distributed delivery of correlated data from sensors in ad hoc network topologies. We propose to use network coding in order to exploit the path diversity in the network for efficient delivery of the sensor information. We furthe ...

2010

Network coding of rateless video in streaming overlays

Pascal Frossard, Nikolaos Thomos

We investigate the problem of collaborative video streaming in overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes in order to increase the overall throughput and improve the video quality at th ...

Institute of Electrical and Electronics Engineers2010

Asymmetric Multilevel Diversity Coding and Asymmetric Gaussian Multiple Descriptions

Suhas Diggavi

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of 2(K) - 1 information sources, ordered in a decreasing level of importance, is encoded into K messages (or descriptions). There are 2(K) - 1 decoders, each of which has a ...

2010

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...

2010