Fountain code

Known as: Rateless erasure code, Fountain codes, Rateless erasure correcting code 
In coding theory, fountain codes (also known as rateless erasure codes) are a class of erasure codes with the property that a potentially limitless… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Ideally, the throughput of a Multipath TCP (MPTCP) connection should be as high as that of multiple disjoint single-path TCP… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Application-layer forward error correction (FEC) is used in many multimedia communication systems to address the problem of… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Fountain codes were introduced as an efficient and universal forward error correction (FEC) solution for data multicast over… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
With the explosive growth of wireless multimedia applications over the wireless Internet in recent years, the demand for radio… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Cooperative communications, where parallel relays forward information to a destination node, can greatly improve the energy… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We investigate the problem of constructing fountain codes for distributed storage in sensor networks. Specifically, we assume… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers… (More)
  • table II
  • figure 1
  • table III
  • figure 3
  • table IV
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the… (More)
Is this relevant?