Reed solomon decoder fails

Question

Reed solomon decoder fails

MageSlayer opened this issue 8 years ago · 4 comments

See attached diff with test where Reed-Solomon fails to recover 11 bit error even though it has 32 bits of parity (16 error bits should be guaranteed).

a.zip

Answer 1 · 2017-04-10T21:57:22.000Z

Hi @MageSlayer

Thanks for the report. I'll have a closer look tonight.

Just to be clear, libcorrect's symbol size is 8 bits. With RS, an error in any symbol, even if it's only one bit, consumes one of your error budget. So I will need to look at this more closely, but it looks like in your example the error budget is 2, which could tolerate more than 2 bits of error only if these bits are located within the same 2 bytes. Is this true for your test case?

Answer 2 · 2017-04-11T06:04:14.000Z

Nope, I think the error is distributed across 8 bytes.

Answer 3 · 2017-04-11T06:08:59.000Z

@MageSlayer Unfortunately libcorrect can presently only do 8-bit symbols :( It looks like your use case would be well-served by 1-bit symbols. In this case I'd recommend trying libfec which I believe can do arbitraily sized symbols

Answer 4 · 2017-04-11T07:03:42.000Z

Ok. Thanks.
I'll check libfec :)