views:

164

answers:

1

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't know which byte(s) were dropped? Will Reed-Solomon error correction work?

Thanks,
Ben

+6  A: 

RS decoding for erasures requires the position of the symbols "dropped" or lost. The kind of error you're talking about is due to phase distortion.

dman
Does RS know that it is "undecidable", and if so, would it work to attempt to put a 0 or 0xFF in each possibly missing byte position and rerun until it comes back as "decidable"?
When performing RS-decoding there are a few places in which the decoder can decide if the given codeword is not decodable1. Expected number of symbols not provided2. The number of erasures passed in is greater than the number that can be handled with the current decoder3. When computing the syndrome of the codeword the number of errors is greater than what the current decoder can handle
dman