The efficient implementation of Reed-Solomon high rate erasure resilient codes

In this paper, we investigate the efficient implementation of Reed-Solomon high rate erasure resilient codes. Though the implementation of Reed-Solomon codes for error correction coding has been extensively investigated in the past, there is little work on the efficient implementation of Reed-Solomon codes for high rate erasure resilient coding application. In this paper, we investigate a number of technologies, including the direct inverse of the Reed-Solomon sub-generator matrix, and the scalar vector multiplication and addition on the Galois Field to speed zip the Reed-Solomon erasure encoding/decoding operations. Our implementation of the Reed-Solomon erasure code achieves an encoding/decoding throughput of 25MB per second, (i.e., 200Mps), on a Pentium 2.8Ghz computer.