reed-solomon-novelpoly
| Crates.io | reed-solomon-novelpoly |
| lib.rs | reed-solomon-novelpoly |
| version | 2.0.0 |
| created_at | 2021-03-11 13:11:17.675086+00 |
| updated_at | 2024-01-25 15:29:59.219109+00 |
| description | An implementation of a reed solomon code / encoder / decoder with complexity `O(n lg(n))` |
| homepage | |
| repository | https://github.com/paritytech/reed-solomon-novelpoly |
| max_upload_size | |
| id | 367284 |
| size | 110,755 |
tokio-metrics-release (github:tokio-rs:tokio-metrics-release)
documentation
README
reed-solomon-novelpoly
An implementation of Novel Polynomial Basis and its Application to Reed-Solomon Erasure Codes 1 2 3.
Runs encoding and reconstruction in O(n lg(n)). Note that for small number n there is a static offset due to a walsh transform over the full domain in reconstruction.
Goals
Be really fast for n > 100.
Benchmarking
For benchmarking the implementation against itself and the naive implementation, criterion is used.
cargo bench
Fuzzing
Currently honggfuzz is used.
Install cargo install cargo-hongg and run with:
cargo-hongg fuzz --bin <binary_name>