Online fountain codes with low overhead

Yuval Cassuto; Amin Shokrollahi

doi:https://doi.org/10.1109/TIT.2015.2422697

Online fountain codes with low overhead

Yuval Cassuto, Amin Shokrollahi

Electrical and Computer Engineering

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower redundancy overhead. The bounding of the code overhead is carried out using the analysis of the dynamics of random-graph processes.

Original language	English
Article number	7084659
Pages (from-to)	3137-3149
Number of pages	13
Journal	IEEE Transactions on Information Theory
Volume	61
Issue number	6
DOIs	https://doi.org/10.1109/TIT.2015.2422697
State	Published - 1 Jun 2015

Keywords

Fountain codes
codes with feedback
on-line codes
random graphs
rateless codes

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

https://doi.org/10.1109/TIT.2015.2422697

Cite this

@article{db1ae2568b4144619d0b653be8527b77,

title = "Online fountain codes with low overhead",

abstract = "An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower redundancy overhead. The bounding of the code overhead is carried out using the analysis of the dynamics of random-graph processes.",

keywords = "Fountain codes, codes with feedback, on-line codes, random graphs, rateless codes",

author = "Yuval Cassuto and Amin Shokrollahi",

note = "Publisher Copyright: {\textcopyright} 1963-2012 IEEE.",

year = "2015",

month = jun,

day = "1",

doi = "https://doi.org/10.1109/TIT.2015.2422697",

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

volume = "61",

pages = "3137--3149",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Online fountain codes with low overhead

AU - Cassuto, Yuval

AU - Shokrollahi, Amin

PY - 2015/6/1

Y1 - 2015/6/1

N2 - An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower redundancy overhead. The bounding of the code overhead is carried out using the analysis of the dynamics of random-graph processes.

AB - An online fountain code is defined as a fountain code for which an optimal encoding strategy can be found efficiently given any instantaneous decoding state. This property is important for data distribution in practical networks. In this paper, we formalize the problem of online fountain code construction, and propose new online fountain codes that outperform known ones in having factor 3-5 lower redundancy overhead. The bounding of the code overhead is carried out using the analysis of the dynamics of random-graph processes.

KW - Fountain codes

KW - codes with feedback

KW - on-line codes

KW - random graphs

KW - rateless codes

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

U2 - https://doi.org/10.1109/TIT.2015.2422697

DO - https://doi.org/10.1109/TIT.2015.2422697

M3 - مقالة

SN - 0018-9448

VL - 61

SP - 3137

EP - 3149

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

M1 - 7084659

ER -

Online fountain codes with low overhead

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this