This paper explores the application of fountain codes to a single-hop multi-relay network. Specifically, we consider a system, in which relays do not decode the information but simply forward coded packets that have been previously received from the source. This allows for uncoordinated, low-complexity processing at the relays. We present a detailed analysis of the proposed network model, which represents an instance of a new coding scheme that we refer to as distributed fountain coding.
Erasure probability in relay networks employing distributed fountain codes
A Tarable;
2009
Abstract
This paper explores the application of fountain codes to a single-hop multi-relay network. Specifically, we consider a system, in which relays do not decode the information but simply forward coded packets that have been previously received from the source. This allows for uncoordinated, low-complexity processing at the relays. We present a detailed analysis of the proposed network model, which represents an instance of a new coding scheme that we refer to as distributed fountain coding.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
