Publication

Iterative Coding for Network Coding

Related publications (95)

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.

Efficient error correction solutions for OFDM based digital video

Mauro Lattuada

The robustness of the delivery of digital compressed video streams has always been one of the main topic of the standardization bodies to assure the Quality of the Service (QoS). The MPEG standard which is nowadays the reference for digital television defi ...

EPFL2005

On Cascaded Channels with Finite Complexity Processing at Intermediate Nodes

Christina Fragouli, Urs Niesen

We consider communication through an infinite cascade of identical discrete memoryless channels. We allow the source and destination nodes to use coding schemes of arbitrary complexity, but restrict the intermediate (relay) nodes to process blocks of a fix ...

2005

Coding Schemes for Line Networks

Mohammad Amin Shokrollahi, Christina Fragouli

We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the intermediate nodes are required to process the information. We propose codi ...

2005

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

On the capacity of multiple input erasure relay channels: The Non-degraded case

Ramin Khalili

We consider in this paper a network that consists of two senders and two receivers. We further assume that each sender could act as a relay for other communications. All channels connecting these nodes are supposed to be erasure channels where symbols are ...

2005

Single and Multi-Hop ARQ in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

We present a novel error-correction scheme for sensor networks called Multi-hop Hybrid ARQ (MHARQ). Rather than immediately discard a received corrupt packet, a node buffers it. When two corrupt versions of a packet have been received, a procedure attempts ...

2005

Error Control Schemes for On-chip Communication Links: the energy-reliability trade-off

Giovanni De Micheli, Luca Benini

On-chip interconnection networks for future systems on chip (SoC) will have to deal with the increasing sensitivity of global wires to noise sources such as crosstalk or power supply noise. Hence, transient delay and logic faults are likely to reduce the r ...

Institute of Electrical and Electronics Engineers2005

Locally Testable Codes

Mahdi Cheraghchi Bashi Astaneh

Error correcting codes are combinatorial objects that allow reliable recovery of information in presence of errors by cleverly augmenting the original information with a certain amount of redundancy. The availability of efficient means of error detection i ...

2005

Analysis of Error Recovery Schemes for Networks on Chips

Giovanni De Micheli, Luca Benini, Srinivasan Murali

In this article, we discuss design constraints to characterize efficient error recovery mechanisms for the NoC design environment. We explore error control mechanisms at the data link and network layers and present the schemes' architectural details. We in ...

Institute of Electrical and Electronics Engineers2005

On Average Throughput Benefits and Alphabet Size in Network Coding

Christina Fragouli, Emina Soljanin

e analyze a special class of configurations with h sources and N receivers to demonstrate the throughput benefits of network coding and deterministic code design. We show that the throughput benefits network coding offers can increase proportionally to \sq ...

2005