Fountain Coding with Decoder Side Information

Sejdinović, Dino; Piechocki, Robert J.; Doufexi, Angela; Ismail, M.

doi:10.1109/icc.2008.840

Cited by 4 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But how close can we get to this lower bound? As shown in [13,14], standard LT and Raptor codes are not able to make any use of the partial information, and would require that each receiver receives slightly more than k encoding packets, to correctly recover entire message, which is very inefficient, especially for small p. However, slight modification of LT and Raptor codes is able to perform much better, as we demonstrate in the rest of this section.…”

Section: Coding With Partial Informationmentioning

confidence: 88%

“…Even though it has been demonstrated that the universal code parameters generally do not exist for noisy channel models [9], fountain codes have shown promising performance over channels such as binary input additive white Gaussian noise channel (BIAWGNC) [9] and block-fading channels [8]. In addition, fountain codes have been used in the context of lossless data compression [10], distributed source coding [11,12,13,14,15], distributed joint sourcechannel coding [16,17,18], transmission of scalable video [19,20,21,22] and transmission of multiple independent sources in relay networks [23].…”

Section: Fountain Codingmentioning

confidence: 99%

“…A different approach to the design of output degree distributions for fountain codes with decoder side information was developed in [14,15]. This approach uses And-Or performance analysis analogous to that of Lemma 1 and characterizes the role that the decoder side information plays in the structure of the decoding graph.…”

Section: Non-systematic Lt Codes With Modified Degree Distributionmentioning

confidence: 99%

See 2 more Smart Citations

Rateless Distributed Source Code Design

Sejdinović

Piechocki

Doufexi

2009

Proceedings of the 5th International Mobile Multimedia Communications Conference

View full text Add to dashboard Cite

Over the past decade, rateless codes, i.e., digital fountain codes, have emerged as an efficient and robust solution for reliable data transmission over packet erasure networks and a particularly suitable one for multicasting and broadcasting applications where users may experience variable channel conditions and packet loss rates, such as mobile environments. Luby Transform (LT) and Raptor codes are practical fountain codes with a capacity approaching performance and a low computational cost. In addition to their channel coding applications, the use of fountain codes for various kinds of distributed source compression and distributed joint-source channel coding has been extensively studied lately, and with promising results. However, a systematic treatise of the code design and optimization considerations for such non-standard applications of fountain codes is still absent. In this contribution, we overview the main results concerned with rateless codes for distributed source coding and outline several examples of data dissemination protocols where carefully designed fountain codes can provide strikingly simple, yet robust solutions yielding both distributed source coding and channel coding gains.

show abstract

Section: Coding With Partial Informationmentioning

confidence: 88%

Section: Fountain Codingmentioning

confidence: 99%

Section: Non-systematic Lt Codes With Modified Degree Distributionmentioning

confidence: 99%

See 1 more Smart Citation

Rateless Distributed Source Code Design

Sejdinović

Piechocki

Doufexi

2009

Proceedings of the 5th International Mobile Multimedia Communications Conference

View full text Add to dashboard Cite

show abstract

“…The distribution Ω( ) is called the output degree distribution, since it determines the degrees of the output nodes in the decoding graph. The output degree distribution is usually written in the generating polynomial notation 1…”

Section: B Lt Codes and Output Degree Distributionsmentioning

confidence: 99%

Fountain code design for data multicast with side information

Sejdinović

Piechocki

Doufexi

et al. 2009

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Fountain codes are a robust solution for data multicasting to a large number of receivers which experience variable channel conditions and different packet loss rates. However, the standard fountain code design becomes inefficient if all receivers have access to some side information correlated with the source information. We focus our attention on the cases where the correlation of the source and side information can be modelled by a binary erasure channel (BEC) or by a binary input additive white Gaussian noise channel (BIAWGNC). We analyse the performance of fountain codes in data multicasting with side information for these cases, derive bounds on their performance and provide a fast and robust linear programming optimization framework for code parameters. We demonstrate that systematic Raptor code design can be employed as a possible solution to the problem at the cost of higher encoding/decoding complexity, as it reduces the side information scenario to a channel coding problem. However, our results also indicate that a simpler solution, non-systematic LT and Raptor codes, can be designed to perform close to the information theoretic bounds.

show abstract