That is more in depth, but is a lot more math heavy, which the author specifically states they are trying to avoid.
We all know that a polynomial of degree n is basically defined by n points. So a line is defined by 2 points.
If I need to encode the 2 pieces of info [a,b] I can just generate a polynomial ax+b and sample it at 2 points to recover the info. If I sample it at 3 points I can lose any one point and still recover [a,b]. The concept generalizes to higher dimensions and discrete values.
afaik that's basically it.
> This article is for computer engineers who would like to have a high-level understanding of how the dual parity calculation works, without diving into all of the mathematical details.
I believe that is the value proposition for reading: gaining an understanding of RAID-6 parity calculation while glossing over the math-y bits.
