←back to thread

246 points D4Ha | 1 comments | | HN request time: 0.2s | source
Show context
Timwi ◴[] No.42168742[source]
Unfortunately it seems that every online explanation of QR codes always leaves out the Reed-Solomon error code calculation. The author here describes it as “long, tedious, and not very interesting”, but since everyone seems to think that, it is now very hard to find.
replies(5): >>42169094 #>>42170320 #>>42170344 #>>42170889 #>>42170910 #
1. steventhedev ◴[] No.42170320[source]
I took a code theory course in grad school. It was the most rigorous course I took, and for all of the 5 students it was difficult, but I'm also really glad I took it.

Reed Solomon was about two thirds of the way through the semester, and the gist is that it's based on polynomials - with enough points you can define exactly where the polynomial is - so include some extra points and that way if some get lost along the way you can recreate them.

The rest of it is how to apply that for binary data (finite fields). Which is mathematically beautiful, but where they get somewhat complex.