Anyone here have any experience with BCH error correction coding? I
have a project that requires a (252,128) BCH encoding/decoding
capability and am having trouble finding any usefull information on
the subject that is not designed for someone with a Phd in math. Any
pointers, code samples (prefereably for a shorter codeword so I could
actually trace it to see what is going on)or references would be
greatly appreciated. I do have the genereator polynomial and the spec
states I the code is a truncated (255,131) code (I am not really sure
what that means.

I consider myself a fairly smart individual but having no previous
experience with this I am having a hard time with the resources I have
been able to locate.

Thanks

"gooch" <g...@comcast.net>  asked in
news:d...@posting.google.com...
> Anyone here have any experience with BCH error correction coding?

Try typing in "Coding Cookbook" in Google.

"gooch" <g...@comcast.net> wrote in message
news:d...@posting.google.com...
> Anyone here have any experience with BCH error correction coding? I
> have a project that requires a (252,128) BCH encoding/decoding
> capability and am having trouble finding any usefull information on
> the subject that is not designed for someone with a Phd in math. Any
> pointers, code samples (prefereably for a shorter codeword so I could
> actually trace it to see what is going on)or references would be
> greatly appreciated. I do have the genereator polynomial and the spec
> states I the code is a truncated (255,131) code (I am not really sure
> what that means.
>
> I consider myself a fairly smart individual but having no previous
> experience with this I am having a hard time with the resources I have
> been able to locate.
>
> Thanks

Even if you're smart, I think this stuff is really hard to understand.
Peter Sweeney's book is basic, but it does go through some examples with
small codewords so you can actualy work it out by hand.  There are some good
links on the follwing site ( http://www.eccpage.com/ ), including Andrew
Lin's GF calculator which will help you work through problems.
-Kevin

g...@comcast.net (gooch) wrote in message news:<d...@posting.google.com>...
> Anyone here have any experience with BCH error correction coding? I
> have a project that requires a (252,128) BCH encoding/decoding
> capability and am having trouble finding any usefull information on
> the subject that is not designed for someone with a Phd in math. Any
> pointers, code samples (prefereably for a shorter codeword so I could
> actually trace it to see what is going on)or references would be
> greatly appreciated. I do have the genereator polynomial and the spec
> states I the code is a truncated (255,131) code (I am not really sure
> what that means.
> 
> I consider myself a fairly smart individual but having no previous
> experience with this I am having a hard time with the resources I have
> been able to locate.
> 
> Thanks

Hi!

When i worked on RS codes some 3 years back, i was also helpless like
you. I was implementing the RS(15,9) code over
GF(2^4). What you are trying to achive is actually a "shortened" code,
i.e. higer order symbols assumed zeros. You should first try to
understand the full-lenght codes like RS(255,223) or RS(15,9). I dont
claim it to be very good, but i wrote a paper on implementation of RS
codes in FPGA for the EDN magazine. I tried to keep mathematics away,
as much as i can. If you want, you might take a look at:

http://www.tmssales.com/Application_Notes/Digital_Test/reedsolomon.pdf

(I am Saqib ) ...

Regards
Rider