arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.0918cs.ITcs.NImath.IT
收藏

喷泉码的基础与最新进展

Primer and Recent Developments on Fountain Codes

Jalaluddin Qureshi, Chuan Heng Fohy, Jianfei Cai

摘要:

在本文中,我们调查的各种擦除码已提出和专利最近,并沿着调查,我们提供了许多基本概念和阅读的擦除和喷泉码的入门教程。数据包擦除是数据存储和数据传输系统的一个基本特性。传统上,基于复制/重传的技术已经被用来处理这样的系统中的分组擦除。虽然RS纠删码可以提高系统可靠性和减少数据冗余,但RS码的高解码计算成本已经抵消了RS码的更广泛实现。然而,最近数据流量的指数增长和对更大数据存储容量的需求已经酝酿了对纠删码的兴趣。最近的研究结果表明,有希望的结果,以解决纠删码固有的解码计算复杂度和冗余权衡。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑