Coding theory in practice

RS 6-3 tolerates three fragment losses for half the disk that 3x replication needs

Overhead is m over k and tolerance is m, which is all the arithmetic this choice needs. The trap is sizing m from a byte-level Reed-Solomon demo, where ten parity bytes only repair five errors at unknown positions.