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)

Related topics

Related topics

19 relations
AlgorithmAnalysis of algorithmsCode rateCoding theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
On Transmission Efficiency for Wireless Broadcast Using Network Coding and Fountain Codes
This paper investigates the benefits of applying fountain codes (FCs) in improving the transmission efficiency in broadcasting… 
Review
2010
Review
2010
Overview of Robust Video Streaming with Network Coding
This paper provides an overview of applying Network Coding (NC) for robust video streaming in an erasure network. Traditional… 
2010
2010
Networked estimation under contention‐based medium access
This paper studies networked estimation over a communication channel shared by a contention‐based medium access protocol. A… 
Highly Cited
2009
Highly Cited
2009
Fountain codes over fading relay channels
This paper discusses cooperative protocols based on fountain codes in a relay network. Unlike traditional fixed-rate codes… 
2008
2008
Expanding Window Fountain codes for scalable video multicast
Digital Fountain (DF) codes have recently been suggested as an efficient forward error correction (FEC) solution for video… 
2008
2008
Slice Sorting for Unequal Loss Protection of Video Streams
In this letter, we propose a novel unequal loss protection scheme, which allocates FEC codes to video slices according to their… 
Highly Cited
2008
Highly Cited
2008
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
We consider large-scale networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other… 
2007
2007
An Alliance Based Peering Scheme for P2P Live Media Streaming
While recent measurement studies have shown the effectiveness of P2P network in media streaming, there have been questions raised… 
Highly Cited
2006
Highly Cited
2006
Distributed Fountain Codes for Networked Storage
We investigate the problem of constructing fountain codes for distributed storage in sensor networks. Specifically, we assume… 
2004
2004
Universal variable-length data compression of binary sources using fountain codes
This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)