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.
Gr{oetje,eeting}s,
Geert
--
Geert Uytterhoeven -- There's lots of Linux beyond ia32 -- geert@xxxxxxxxxxxxxx
In personal conversations with technical people, I call myself a hacker. But
when I'm talking to journalists I just say "programmer" or something like that.
-- Linus Torvalds
