Does Reed-Solomon error correction work in an instance where there is a dropped byte (or multiple dropped bytes)? For example, let's say it's a (12,8) Reed Solomon code, so theoretically it should be able to correct 2 errors (or 4 erasures if the position is known). But, what happens if only 11 (or 10) bytes are received and one doesn'...
Hi I am looking for a very memory-efficient (like max. 500 bytes of memory for lookup tables etc.) implementation of a Reed-Solomon encoder for use in an embedded application? I am interested in coding blocks of 10 bytes with 5 bytes of parity. Speed is of little importance. Do you know any freely available implementations that I can ...
Hi, I'd like advice on a book or web resource, that comprehensively teaches me Reed-Solomon error correction. I found some web resources and some university PDF's, but none of them was able to really teach me how to compute it (and error correct afterwards). I'd prefer a book on it if possible. For clarification: I'm not looking for a...