Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
-
Updated
Sep 7, 2017 - C++
Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
Reed-Solomon Erasure Code engine in Go, could more than 15GB/s per core
Fast, reliable Reed-Solomon erasure coding as a native addon for Node.js.
Fast and efficient data reconstruction Erasure code, saving about 30% I/O in reconstruction
Fast Erasure Coding Library for Large Number of Data and Parities
Object Storage Open Source
Odilon Object Storage - Java SDK
This repository contains demos of algorithms related to erasure codes.
JSON Model used by Odilon Server and Client
Add a description, image, and links to the erasure-codes topic page so that developers can more easily learn about it.
To associate your repository with the erasure-codes topic, visit your repo's landing page and select "manage topics."