On Tue, 9 Jul 2019, Geert Uytterhoeven wrote:
Hi Ferdinand,
On Thu, Jun 20, 2019 at 4:13 PM Ferdinand Blomqvist
<ferdinand.blomqvist@xxxxxxxxx> wrote:
A Reed-Solomon code with minimum distance d can correct any error and
erasure pattern that satisfies 2 * #error + #erasures < d. If the
error correction capacity is exceeded, then correct decoding cannot be
guaranteed. The decoder must, however, return a valid codeword or report
failure.
Note that the tests take a couple of minutes to complete.
On which hardware? ;-)
JFTR, the test succeeded on m68k, after 6 hours and 12 minutes of runtime
on an emulated Atari Falcon (ARAnyM hosted by an i7-4770).
So far I have no plans to run it on bare metal.
It took about 4 minutes on a 10 year old lame desktop and was way faster on
one of the big irons.
Thanks,
tglx
