This crate provides an encoder/decoder for Reed-Solomon erasure code.
Please note that erasure coding means errors are not directly detected or corrected, but missing data pieces (shards) can be reconstructed given that the configuration provides high enough redundancy.
You will have to implement error detection separately (e.g. via checksums) and simply leave out the corrupted shards when attempting to reconstruct the missing data.
Implementation of GF(2^8): the finite field with 2^8 elements.
Makes it easier to work with 2D slices, arrays, etc.
Constructs vector of shards.
Parameters for parallelism.
Reed-Solomon erasure code encoder/decoder.
Bookkeeper for shard by shard encoding.
A finite field to perform encoding over.
Something which might hold a shard.