github.com2026-06-26authorityHN 16 pts · 2 comments508 words
ReedSolomonForOcr implements Reed-Solomon over GF(256) to provide error correction for printed codes and labels. The system supports a maximum codeword length of 255 symbols and corrects up to floor(nsym / 2) unknown symbol errors. Parity bytes are encoded as two characters from the OCR-safe alphabet 23456789ACDEFHJKLMNPQRTUWXY to handle look-alike character confusion.written, reviewed, cited
github.com2017-05-08authorityHN front pageHN 151 pts · 37 comments1,620 words
FastECC implements an O(N*log(N)) Reed-Solomon coder that outperforms previously fastest libraries like Intel ISA-L for 64+ parity blocks, whereas most existing implementations suffer from O(N^2) speed behavior. The library runs at 1.2 GB/s on an i7-4770 for 524288 parity blocks, though future decoding support will be 1.5-3 times slower than encoding. It is currently limited to 2^20 blocks and requires data conversion for GF(0xFFF00001) operations.written, reviewed, cited
- FastECC is absolutely useless for RAID storage because recompute operations require reading all other data sectors in the same shard.
- The library implements only erasure decoding and the author has no idea how to implement error decoding nor plans to learn it.