FNT-based Reed-Solomon Erasure Codes
Alexandre Soro, Jerome Lacan
TL;DR
This paper introduces a new FNT-based Reed-Solomon erasure coding method that achieves efficient encoding and decoding with practical speeds, suitable for large-scale data dispersal systems.
Contribution
It presents a novel FNT-based construction of MDS Reed-Solomon codes with efficient algorithms and open-source implementation, enhancing performance for large data sets.
Findings
Encoding speed up to 150Mbps for large code lengths
Supports practical coding and decoding complexity of O(n log n)
Suitable for use in P2P systems as part of IDA
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Advanced Data Storage Technologies · Error Correcting Code Techniques