🚀 go-pugleaf

RetroBBS NetNews Server

Inspired by RockSolid Light RIP Retro Guy

Article View: sci.math.research
Article #207

BCH Block Length?

#207
From: alavarre
Date: Mon, 13 Jun 1994 12:03
26 lines
1916 bytes
Why must a BCH code have as a length the multiplicative order 
of alpha?  

Michelson, p. 121, states, without proof, that "The block 
length of a  BCH code is the order of the element used in 
defining the consecutive roots [of the generator polynomial]."  
Gallager gives the same as a defined property of a BCH code.  
My question is "why?"

I can see how the order (q) of the elements on GF(q) results in 
q distinct roots, hence a generator polynomial of degree q, and 
that for an extension field GF(2^m), q=2^m is always even, 
making the generator polynomial always of odd length.
  
But it seems that the information word length k can be 
arbitrary, and the resulting codeword must then be of arbitrary 
degree (and length).

So how does the choice of a particular generator constrain the 
number of information bits and hence the length of the codeword?  And 
why does the order of alpha matter?

TIA,
Andy La Varre
alavarre@ids.net
Technical Details
Message-ID: <2tk2pr$opp@paperboy.ids.net>
Path: arc1-ca.pugleaf.net!nntp.gmd.de!newsserver.jvnc.net!yale.edu!nigel.msen.com!emory!europa.eng.gtefsd.com!howland.reston.ans.net!vixen.cso.uiuc.edu!dan

Show Full Headers
Complete Article Headers
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 141b19,bd9d1b3aaad35c05,start
X-Google-Attributes: gid141b19,public
X-Google-Thread: f803e,bd9d1b3aaad35c05,start
X-Google-Attributes: gidf803e,public
X-Google-Thread: 10d29f,bd9d1b3aaad35c05,start
X-Google-Attributes: gid10d29f,public
X-Google-ArrivalTime: 1994-06-13 07:01:32 PST
Path: arc1-ca.pugleaf.net!nntp.gmd.de!newsserver.jvnc.net!yale.edu!nigel.msen.com!emory!europa.eng.gtefsd.com!howland.reston.ans.net!vixen.cso.uiuc.edu!dan
From: alavarre@ids.net
Newsgroups: sci.math.research,info.theorynt,bionet.info-theory
Subject: BCH Block Length?
Date: Mon, 13 Jun 94 07:03:17 EST
Organization: IDS World Network Internet Access Service, (401) 884-9002 GUEST
Lines: 27
Approved: Daniel Grayson <dan@math.uiuc.edu>, moderator for sci.math.research
Message-ID: <2tk2pr$opp@paperboy.ids.net>
NNTP-Posting-Host: symcom.math.uiuc.edu
Mime-Version: 1.0
Originator: dan@symcom.math.uiuc.edu