Reed Solomon — OZONE Asylum, home of the Mad Scientists

OZONE

This page's ID: 28653

Edit Post

Who can edit a post?	The poster and administrators may edit a post. The poster can only edit it for a short while after the initial post.

Your User Name:
Your Password:
Login Options:	Remember Me On This Computer

Your Text: Insert Slimies » Insert UBB Code » Close Last Tag \| All Tags UBB Help	Thanks hyperbole. Your emails where quite helpful, I shall actually reply the next couple of days. What I have on the one hand is this "The polynomial divisor for generating 5 check characters is: g(x) = x5 + 62x4 + 111x3 + 15x2 + 48^x + 228. " (all GF arithmetic, I suppose). On the other hand, I need this: "symsize gives the symbol size in bits, up to 8 for init_rs_char or 32 for init_rs_int on a machine with 32-bit ints (though such a huge code would exhaust memory limits on a 32-bit machine). The resulting Reed-Solomon code word will have 2^symsize - 1 symbols, each containing symsize bits." This is 8, I understand that much. "gfpoly gives the extended Galois field generator polynomial coefficients, with the 0th coefficient in the low order bit. The polynomial must be primitive; if not, the call will fail and NULL will be returned." ? "fcr gives, in index form, the first consecutive root of the Reed Solomon code generator polynomial." ??? "prim gives, in index form, the primitive element in the Galois field used to generate the Reed Solomon code generator polynomial." ??? "nroots gives the number of roots in the Reed Solomon code generator polynomial. This equals the number of parity symbols per code block." I can read that out straight out of a table. Thanks again for all your time! Loading...
Options:	Enable Slimies Enable Linkwords

« Backwards — Onwards »

Show Forum Drop Down Menu