Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper proposes a device cooperation-assisted solution for efficient quality-of-experience (QoE)-differentiated scalable… 
Highly Cited
2011
Highly Cited
2011
This paper investigates the benefits of applying fountain codes (FCs) in improving the transmission efficiency in broadcasting… 
Review
2010
Review
2010
This paper provides an overview of applying Network Coding (NC) for robust video streaming in an erasure network. Traditional… 
2010
2010
This paper studies networked estimation over a communication channel shared by a contention‐based medium access protocol. A… 
2010
2010
The remarkable results of Fountain codes over the binary erasure channel (BEC) have motivated research on their practical… 
Highly Cited
2009
Highly Cited
2009
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes… 
2008
2008
In this letter, we propose a novel unequal loss protection scheme, which allocates FEC codes to video slices according to their… 
2008
2008
Digital Fountain (DF) codes have recently been suggested as an efficient forward error correction (FEC) solution for video… 
Highly Cited
2008
Highly Cited
2008
Fountain codes are designed for erasure channels, and are particularly well suited for broadcast applications from a single… 
2007
2007
While recent measurement studies have shown the effectiveness of P2P network in media streaming, there have been questions raised…