BCH code help seeked

Article View: comp.protocols.misc

Article #431

Back to comp.protocols.misc Previous Next

#431

From: William Y. Lai
Date: Tue, 06 Oct 1992 13:35

24 lines
1335 bytes

I am tasked to implement the following BCH code:

Block length: 63
Data Length : 56
Generator Polynomial:  x^7 + x^6 + x^2 + 1

The closest one I can find in Lin & Costello is a (n=63, k=57, t=1) code.
Can anyone help?  It has been years since I took my coding class, and I
am embarass to admit I don't remember very much... :-(

Also, is there any efficient method in implementing the encoding/decoding
of BCH codes, or any cyclic does in general (given a correct generator
polynomial is located) ?  Is there any Table Look-Up algorithm like those
used with CRC-32?  Any pointers, algorithms, and codes is greatly
apprecitaed!

Regards,

William Lai
-- 
email: lai@seas.gwu.edu | "I want to do everything.  I want to have everything.
Dept. of Electrical Eng.|  I have a wonderful, wonderful life.  But there's so
George Washington Univ. |  much more out there.  Do I have it all?  Yes.  Do I
Washington, D.C.        |  want more?  Yeah, sure."     -Demi Moore

Technical Details

Message-ID: <1992Oct6.133559.15329@seas.gwu.edu>

Path: arc1-ca.pugleaf.net!sparky!uunet!seas.gwu.edu!lai

Show Full Headers

Complete Article Headers

Newsgroups: comp.protocols.misc
Path: arc1-ca.pugleaf.net!sparky!uunet!seas.gwu.edu!lai
From: lai@seas.gwu.edu (William Y. Lai)
Subject: BCH code help seeked
Message-ID: <1992Oct6.133559.15329@seas.gwu.edu>
Originator: lai@seas.gwu.edu
Sender: news@seas.gwu.edu
Organization: George Washington University
Date: Tue, 6 Oct 1992 13:35:59 GMT
Lines: 24