Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,226,745 papers from all fields of science
Search
Sign In
Create Free Account
Fountain code
Known as:
Rateless erasure code
, Fountain codes
, Rateless erasure correcting code
Expand
In coding theory, fountain codes (also known as rateless erasure codes) are a class of erasure codes with the property that a potentially limitless…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
19 relations
Algorithm
Analysis of algorithms
Code rate
Coding theory
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
LT Codes Combined with Network Coding for Multihop Powerline Smart Grid Networks
A. Kabore
,
V. Meghdadi
,
J. Cances
arXiv.org
2015
Corpus ID: 558059
This paper describes a novel approach for combining Luby Transform (LT) codes and Network Coding (NC) in the context of PowerLine…
Expand
2014
2014
Device cooperation-assisted scalable video multicast with heterogeneous QoE guarantees
Yu Cao
,
A. Maaref
International Symposium on Wireless Communication…
2014
Corpus ID: 665956
This paper proposes a device cooperation-assisted solution for efficient quality-of-experience (QoE)-differentiated scalable…
Expand
2013
2013
A Timescale Based on the World’s Fountain Clocks
G. Petit
2013
Corpus ID: 125716993
2009
2009
JigDFS: A secure distributed file system
J. Bian
,
R. Seker
IEEE Symposium on Computational Intelligence in…
2009
Corpus ID: 14917944
Ubiquitous connectivity and availability of P2P resources creates opportunities for building new services. This paper describes…
Expand
2009
2009
Reducing Content Distribution Time in P2P-based Multicast Using Rateless Codes
Marco Grangetto
,
R. Gaeta
,
M. Sereno
2009
Corpus ID: 14752143
In this paper a novel protocol for application level multicast, that is designed so as to exploit the advantages offered by…
Expand
2009
2009
Trapping Sets in Fountain Codes over Noisy Channels
Vivian Lucia Orozco
2009
Corpus ID: 18048166
Fountain codes have demonstrated great results for the binary erasure channel and have already been incorporated into several…
Expand
2008
2008
Slice Sorting for Unequal Loss Protection of Video Streams
E. Baccaglini
,
T. Tillo
,
G. Olmo
IEEE Signal Processing Letters
2008
Corpus ID: 17981387
In this letter, we propose a novel unequal loss protection scheme, which allocates FEC codes to video slices according to their…
Expand
2008
2008
Stored Media Streaming in BitTorrent-like P2P Networks
Kyung-Wook Hwang
,
V. Misra
,
D. Rubenstein
2008
Corpus ID: 2557879
Peer-to-peer (P2P) networks exist on the Internet today as a popular means of data distribution. However, conventional uses of…
Expand
2006
2006
An interview with digital fountain's charlie oppenheimer
Charlle Oppenhelrne
2006
Corpus ID: 113590636
Review
2000
Review
2000
CAPACITY APPROACHING CODES DESIGN AND IMPLEMENTATION SPECIAL SECTION Fountain codes
D. MacKay
2000
Corpus ID: 7532530
Fountain codes are record-breaking sparse-graph codes for channels with erasures, such as the internet, where files are…
Expand