Soro, Alexandre and Lacan, Jérôme FNT-based reed-solomon erasure codes. (2009) In: 7th Annual IEEE Consumer Communications and Networking Conference , 09-12 Jan 2010, Las Vegas, United States.
![[img]](http://oatao.univ-toulouse.fr/style/images/fileicons/application_pdf.png) | (Document in English) PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 300Kb |
Official URL: http://dx.doi.org/10.1109/CCNC.2010.5421749
Abstract
This paper presents a new construction of Maximum-Distance Separable (MDS) Reed-Solomon erasure codes based on Fermat Number Transform (FNT). Thanks to FNT, these codes support practical coding and decoding algorithms with complexity O(n log n), where n is the number of symbols of a codeword. An open-source implementation shows that the encoding speed can reach 150Mbps for codes of length up to several 10,000s of symbols. These codes can be used as the basic component of the Information Dispersal Algorithm (IDA) system used in a several P2P systems.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Thanks to IEEE. The definitive version is available at http://ieeexplore.ieee.org |
| Audience (journal): | International peer-reviewed journal |
| Audience (conference): | International conference proceedings |
| Uncontrolled Keywords: | |
| Institution: | Université de Toulouse > Institut Supérieur de l'Aéronautique et de l'Espace - ISAE |
| Laboratory name: | Département de Mathématiques, Informatique, Automatique - DMIA (Toulouse, France) - Modelisation et Architecture des Systèmes - MARS |
| Statistics: | download |
| Total amount of citations (from ISI Web of Science): | 0 |
| Deposited By: | Alexandre Soro |
Repository Staff Only: item control page
