On: Reed Solomon codes are cool

[nayuki]

I explained all the linear algebra involved in the Peterson-Gorenstein-Zierler decoder and offer a working implementation in https://www.nayuki.io/page/reed-solomon-error-correcting-cod... ; https://news.ycombinator.com/item?id=13565939

It runs in O(n^3) time, and unfortunately is not the state of the art. What actual Reed-Solomon implementations use are the Berlekamp-Massey and Forney algorithms, which run in O(n^2) time.

[abraae → nayuki]

Incredible. This is the sort of thing my non-programmer friends think that my work entails. Thank god it doesn't.

[kragen → nayuki]

Oh, that's wonderful! Your explanations are always the best. Thank you, magical girl Nayuki!