Reed-Solomon algorithm

[puffpio]

How does it work? After much google'ing I've only come up with what it is, or a very high level overview of how it works...

I need to know how it works so I can calculate the parity bits myself for an arbitrary word size, message length, and parity length.

Anyone have any good links?

 

[Peter]

Please folks, this isn't the Homework Channel ...

What's wrong with Google's first hit?

http://www.4i2i.com/reed_solomon_codes.htm

Plenty of pointers in there.

 

[puffpio]

cuz ti's not detailed enuf..or it's from a mathematical on not programmatical point of view

and this is not for HW

 

[Peter]

So you need help converting math into code? Have you tried the references given at the bottom of the page I referred you to?

Come on, dig a little yourself. Reed-Solomon is not an obscure practice, examples are all over the place.

 

[puffpio]

🙂 i appreciate it 🙂

I've been googling like crazy. the references at the bottom of the page refer to books, and not online references

 

[Peter]

And the problem with that is? Goto library, read book, sorted.

 

[JMaster]

peter if you can help him, do it. he obviously didn't come here to ask where the nearest library is.

 

[Matthias99]

I don't think it's totally unreasonable to ask someone to do some research on their own. He's asking for information about a well-known, well-documented algorithm, not some obscure piece of information that's unavailable anywhere. And now he has titles of several books which likely contain extremely thorough descriptions of exactly what he's looking for. The right move at this point *is* the library, not pestering some stranger online who has better things to do than force-feed information to you.

IMHO, anyway. 🙂

 

[Peter]

Originally posted by: JMaster
peter if you can help him, do it. he obviously didn't come here to ask where the nearest library is.

If I had any online links, I'd given them. My knowledge about R-S is in my nearest library, too.