Department of Mathematics, Computer Science, Control of the ISAE

FNT-based Reed-Solomon Codes

3 November 2009

This project aims at developping 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.

This implementation can be downloaded here.

The description and the performance of this codec are described in submitted paper.

The code is available for download here.

Contact Jérôme Lacan

Mentions légales | Plan d’accès | Site Map | Follow-up of the site's activity RSS 2.0 |