Publication

The case for structured random codes in network communication theorems

Related publications (68)

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.

Directly lower bounding the information capacity for channels with IID deletions and duplications

We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information capacity using ideas from renewal theory, rather than focusing on the transmis ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Systems and methods for broadcasting information additive codes

Mohammad Amin Shokrollahi

A broadcasting system for communicating data to multiple receivers using information additive code includes one or more information additive code transmitters and one or more information additive code receivers. Each of the information additive code transm ...

2007

Multiple Description H.264 Coding with Redundant Pictures

Pascal Frossard, Ivana Radulovic

Multiple description coding (MDC) o®ers a competitive so- lution for video transmission over lossy packet networks, with a graceful degradation of the reproduced quality as the loss rate increases. This paper illustrates how redundant pictures, an error re ...

2007

Computing over multiple-access channels with connections to wireless network coding

Michael Christoph Gastpar

We study the problem of multicasting over a network of multiple-access channels (MACs). The separation-based solution to this problem is to reduce each MAC to a set of noiseless bit pipes via a channel code and,then employ network coding. Sometimes, howeve ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

Belief Propagation Decoding for Codes Based on Discretized Chaotic Maps

Martin Hasler, Slobodan Kozic

In this paper a class of discretized piecewise linear chaotic maps of a very high dimensions are used for communication over a noisy channel. An information payload that is sent over a channel is controlled in the transmitter and is related to the symbolic ...

2006

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

We examine the throughput benefits that network coding offers with respect to the average through- put achievable by routing, where the average throughput refers to the average of the rates that the indi- vidual receivers experience. We relate these benefi ...

2006

On cooperation via noisy feedback

Michael Christoph Gastpar

An upper bound is established on the usefulness of noisy feedback for the two-user multiple-access channel (MAC). The bound generalizes a dependence-balance argument developed by Hekstra and Willems for the common-output two-way channel and the MAC with no ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

Joint source-channel coding with feedback

Communications is about conveying information from one point to another subject to certain performance constraints. The information is assumed to be generated by a source and may, for example, represent a voice waveform, the reading of a thermal sensor, or ...

EPFL2005

Power, Spatio-Temporal Bandwidth, and Distortion in Large Sensor Networks

Martin Vetterli, Michael Christoph Gastpar

For a class of sensor networks, the task is to monitor an underlying physical phenomenon over space and time through an imperfect observation process. The sensors can communicate back to a central data collector over a noisy channel. The key pa- rameters i ...

Institute of Electrical and Electronics Engineers2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

2005