Latest / Deep End Era. Engineering with Sankalp
Surviving the Lost Disk: Erasure Coding from Reed–Solomon to Cloud Storage
At three in the morning a rack switch dies and a thousand drives vanish, and storage reliability engineer Priya Raman goes back to sleep. This episode explains why. We build erasure coding from first principles: ex-or parity and the RAID five rebuild window; RAID six's weighted Q parity; finite fields and why G F of two to the eight lets bytes be divided; Reed and Solomon's nineteen-sixty polynomial codes, where any k of n pieces rebuild the data; maximum distance separable codes and the Singleton bound; Vandermonde and Cauchy generator matrices in systematic form. Then the problem scale…
The skinny
The skinny isn't ready yet — notes appear once the transcript is processed.