Geek Answers Handbook

Reed-Solomon Transformation

I have a sequence of 28 bytes that are supposedly encoded by the Reed-Solomon code (28, 24, 5). RS code uses 8-bit characters and works in GF (2 8 ). Field generator polynomial x 8 + x 4 + x 3 + x 2 +1. I am looking for an easy way to decode this sequence, so I can tell if there are errors in this sequence.

I tried the Python module ReedSolomon , but I'm not even sure how to properly configure the codec for my RS code (for example, what is the first consecutive root of a polynomial field generator, what is a primitive element). I also looked at Schifra , but I couldn’t even compile it on my Mac.

I care about the platform (e.g. Python, C, Scilab) if it is free.

+6
error-correction
source share
1 answer

I successfully built an embedded data project that used Reed Solomon's error correction several years ago. I just looked at it to refresh my memory, and I found that I was using a fairly lightweight, licensed GPL C language subsystem, published by a famous guy named Phil Karn, to do the encoding and decoding. These are just a few hundred lines of code, but this is pretty intense stuff. However, I found that I did not need to understand math in order to use the code.

Googling Phil Karn Reed Solomon received me this document .

What a decent place to start looks like. Hope this helps.

+8
source share

More articles:


All Articles