On-line fountain codes for semi-random loss channels

Yuval Cassuto; Amin Shokrollahi

doi:https://doi.org/10.1109/ITW.2011.6089433

On-line fountain codes for semi-random loss channels

Yuval Cassuto, Amin Shokrollahi

Electrical and Computer Engineering

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A fountain coding framework is proposed that endows receivers with the ability to monitor and control the decoding progress given the instantaneous network conditions. These online features allow an optimal recovery from losses manifested by adversarial or other not purely random processes. A uni-partite graph structure and accompanying algorithms are used to efficiently calculate optimal instantaneous degrees. Using analysis of random-graph processes, the average overhead of a simplified scheme is shown to be upper bounded by 0.236, significantly lower than any known on-line fountain scheme.

Original language	English
Title of host publication	2011 IEEE Information Theory Workshop, ITW 2011
Pages	262-266
Number of pages	5
DOIs	https://doi.org/10.1109/ITW.2011.6089433
State	Published - 2011
Event	2011 IEEE Information Theory Workshop, ITW 2011 - Paraty, Brazil Duration: 16 Oct 2011 → 20 Oct 2011

Publication series

Name	2011 IEEE Information Theory Workshop, ITW 2011

Conference

Conference	2011 IEEE Information Theory Workshop, ITW 2011
Country/Territory	Brazil
City	Paraty
Period	16/10/11 → 20/10/11

All Science Journal Classification (ASJC) codes

Information Systems

Access to Document

https://doi.org/10.1109/ITW.2011.6089433

Cite this

@inproceedings{f9670a2b43fe4df7a98df49c90d630dc,

title = "On-line fountain codes for semi-random loss channels",

abstract = "A fountain coding framework is proposed that endows receivers with the ability to monitor and control the decoding progress given the instantaneous network conditions. These online features allow an optimal recovery from losses manifested by adversarial or other not purely random processes. A uni-partite graph structure and accompanying algorithms are used to efficiently calculate optimal instantaneous degrees. Using analysis of random-graph processes, the average overhead of a simplified scheme is shown to be upper bounded by 0.236, significantly lower than any known on-line fountain scheme.",

author = "Yuval Cassuto and Amin Shokrollahi",

year = "2011",

doi = "https://doi.org/10.1109/ITW.2011.6089433",

language = "الإنجليزيّة",

isbn = "9781457704376",

series = "2011 IEEE Information Theory Workshop, ITW 2011",

pages = "262--266",

booktitle = "2011 IEEE Information Theory Workshop, ITW 2011",

note = "2011 IEEE Information Theory Workshop, ITW 2011 ; Conference date: 16-10-2011 Through 20-10-2011",

}

TY - GEN

T1 - On-line fountain codes for semi-random loss channels

AU - Cassuto, Yuval

AU - Shokrollahi, Amin

PY - 2011

Y1 - 2011

N2 - A fountain coding framework is proposed that endows receivers with the ability to monitor and control the decoding progress given the instantaneous network conditions. These online features allow an optimal recovery from losses manifested by adversarial or other not purely random processes. A uni-partite graph structure and accompanying algorithms are used to efficiently calculate optimal instantaneous degrees. Using analysis of random-graph processes, the average overhead of a simplified scheme is shown to be upper bounded by 0.236, significantly lower than any known on-line fountain scheme.

AB - A fountain coding framework is proposed that endows receivers with the ability to monitor and control the decoding progress given the instantaneous network conditions. These online features allow an optimal recovery from losses manifested by adversarial or other not purely random processes. A uni-partite graph structure and accompanying algorithms are used to efficiently calculate optimal instantaneous degrees. Using analysis of random-graph processes, the average overhead of a simplified scheme is shown to be upper bounded by 0.236, significantly lower than any known on-line fountain scheme.

UR - http://www.scopus.com/inward/record.url?scp=83655191140&partnerID=8YFLogxK

U2 - https://doi.org/10.1109/ITW.2011.6089433

DO - https://doi.org/10.1109/ITW.2011.6089433

M3 - منشور من مؤتمر

SN - 9781457704376

T3 - 2011 IEEE Information Theory Workshop, ITW 2011

SP - 262

EP - 266

BT - 2011 IEEE Information Theory Workshop, ITW 2011

T2 - 2011 IEEE Information Theory Workshop, ITW 2011

Y2 - 16 October 2011 through 20 October 2011

ER -

On-line fountain codes for semi-random loss channels

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this