Title :
FNT-Based Reed-Solomon Erasure Codes
Author :
Soro, Alexandre ; Lacan, Jérôme
Author_Institution :
ISAE/DMIA, Univ. of Toulouse, Toulouse, France
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 150 Mbps 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.
Keywords :
Reed-Solomon codes; computational complexity; network coding; peer-to-peer computing; transform coding; Fermat number transform; P2P systems; Reed-Solomon erasure codes; information dispersal algorithm system; maximum-distance separable codes; open-source implementation; practical coding; Codecs; Communications Society; Decoding; Encoding; Fast Fourier transforms; Galois fields; Open source software; Polynomials; Propagation losses; Reed-Solomon codes;
Conference_Titel :
Consumer Communications and Networking Conference (CCNC), 2010 7th IEEE
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4244-5175-3
Electronic_ISBN :
978-1-4244-5176-0
DOI :
10.1109/CCNC.2010.5421749
