Primer and Recent Developments on Fountain Codes

TL;DR

This survey reviews recent advances in fountain and erasure codes, highlighting their importance in data transmission and storage, and discusses developments addressing decoding complexity and redundancy issues.

Contribution

It provides an overview of recent erasure code proposals, introduces essential concepts, and discusses advancements in fountain codes to improve efficiency.

Findings

Fountain codes are increasingly important for reliable data transmission.

Recent developments focus on reducing decoding complexity.

Tradeoffs between redundancy and decoding efficiency are being addressed.

Abstract

In this paper we survey the various erasure codes which had been proposed and patented recently, and along the survey we provide introductory tutorial on many of the essential concepts and readings in erasure and Fountain codes. Packet erasure is a fundamental characteristic inherent in data storage and data transmission system. Traditionally replication/ retransmission based techniques had been employed to deal with packet erasures in such systems. While the Reed-Solomon (RS) erasure codes had been known for quite some time to improve system reliability and reduce data redundancy, the high decoding computation cost of RS codes has offset wider implementation of RS codes. However recent exponential growth in data traffic and demand for larger data storage capacity has simmered interest in erasure codes. Recent results have shown promising results to address the decoding computation complexity and redundancy tradeoff inherent in erasure codes.