Bulat-Ziganshin/FastECC
View on GitHub ↗ ★ 430 C++
Reed-Solomon coder computing one million parity blocks at 1 GB/s. O(N*log(N)) algo employing FFT.
3 mentions on Hacker News by 3 people: 2 stories, 1 comment · first 2017-05-08 · latest 2022-07-10
20082026
-
No and yes. For fast Reed-Solomon I'm aware of this: https://github.com/Bulat-Ziganshin/FastECC . It's kind of amazing how far Reed-Solomon has come, thanks to the fast fourier transform. At the very large problem sizes it does slow down…
comment by nightcracker · 2020-07-06 · in Ask HN: What weird or hard problems are you trying to solve?