Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT - Bulat-Ziganshin |
GitHub | https://github.com/Bulat-Ziganshin/FastECC | |
Size | 380K (376K (+4K)) | |
Commits | 200 (0 (+200)) | |
Update Stats | 0s ... 2m10s [Ø (last 10) 14s (1,1,1,130,1,1,1,1,1,1))] | |
Last Change | 2022-07-30 22:33:54 | |
Last Check | 2023-09-15 23:06:40 | |
Created | 2022-07-30 22:33:54 |
Operation
Verifying url ...
Mail to Andreas Kupries