Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
prime
reed-solomon
prime-numbers
switches
galois-field
error-correcting-codes
number-theoretic-transform
erasure-codes
0xffffffff
size-bytes
test-gf
computations-modulo-0xffffffff
forward-error-correction
-
Updated
Sep 7, 2017 - C++
Not particularly interesting overall, just actor model essentially, but could be interesting for people who are curious or doing something similar, especially the benchmark.