3 ms·
The author explains in the README that this specific algorithm is not suited for some of the applications of Reed-Solomon codes, e.g. hardware RAID controllers
by adrian_b 4y ago
The author explains in the README that this specific algorithm is not suited for some of the applications of Reed-Solomon codes, e.g. hardware RAID controllers or communication channels.
However, it is appropriate for protecting archive files against corruption, by adding redundancy that enables the recovery of the complete file when any part of it is lost, as long as the lost parts do not exceed the size of the extra redundant data.
I happen to add such Reed-Solomon redundancy to all my backup/archive files (using "PAR2"). For multi-terabyte archived data, the Reed-Solomon computation can be quite time-consuming, second only to compression, so a faster algorithm can be useful.