Scribd
Upload
18 views19 pages

Itc 13

The document provides an overview of Bose-Chaudhuri-Hocquenghem (BCH) codes, including their significance in error correction and their classification as a subclass of cyclic codes. It discusses the parameters of BCH codes, their generator polynomials, and includes examples of constructing BCH codes for specific parameters. Additionally, it covers concepts related to Galois fields and minimal polynomials relevant to BCH codes.

Uploaded by

jivinanto2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
18 views19 pages

Itc 13

The document provides an overview of Bose-Chaudhuri-Hocquenghem (BCH) codes, including their significance in error correction and their classification as a subclass of cyclic codes. It discusses the parameters of BCH codes, their generator polynomials, and includes examples of constructing BCH codes for specific parameters. Additionally, it covers concepts related to Galois fields and minimal polynomials relevant to BCH codes.

Uploaded by

jivinanto2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 19

BCH codes

Dr.A.Manikandan,
Associate Prof/ECE, Amrita School of Engineering.

AMRITA VISHWA VIDYAPEETHAM

1
Learning Objective
To define Bose-Chaudhuri-Hocquenghem (BCH) codes and their significance
in error correction.

To explain how BCH codes are a subclass of cyclic codes

AMRITA VISHWA VIDYAPEETHAM

2
Introduction

• BCH codes were invented in 1959 by Alexis Hocquenghem, and


independently in 1960 by Raj Chandra Bose and Dwijendra Kumar Ray-
Chaudhuri. Thus, the code has been named as BCH (Bose Chaudhuri
Hocquenghem) code.

• The cyclic structure of this code was observed and subsequently


generalization of binary BCH codes to codes of pm symbols (p is a prime)
was done.

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 3


Contd…

• For any positive integers m (𝑚 ≥ 3) and t (t < 2m − 1), there exist a BCH code
with following parameters.

Block length 𝑛 = 2𝑚 − 1

Number of parity-check bits: 𝑛 − 𝑘 ≤ 𝑚𝑡

Minimum distance : 𝑑𝑚𝑖𝑛 ≥ 2𝑡 + 1

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 4


Primitive elements

• The generator polynomial of this code is specified in terms of its roots


from Galois Þ eld GF(2m).

• If 𝛼 is the primitive element of GF(2m), then the generator polynomial g(x)


of t-error-correcting BCH code of length 2m − 1 is the lowest degree
polynomial with the roots as 𝛼, 𝛼 2 , 𝛼 3 , . . 𝛼 2𝑡 and also the conjugates of
them [i.e. 𝑔 𝛼 𝑖 = 0, 𝑓𝑜𝑟 1 ≤ 𝑖 ≤ 2𝑡,]. If 𝜙𝑖 (𝑥) has the root as 𝛼 𝑖 , g(x) is
least common multiple of 𝜙1 (𝑥), 𝜙2 (𝑥)…. 𝜙2𝑡 (𝑥) is

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 5


Example

• For n = 7 and k = 4, t = 1, this means single-error-correcting code may be


generated.

• Similarly, for n = 15 and k = 11, t = 1 or this is also a single-error-


correcting code. For n = 15, double error correction and 3-error
correction can be achieved with k = 7 and k = 5, respectively.

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 6


Example

• Consider a BCH code with parameter m = 3 and t = 1

• Let α be a primitive element of GF(2m) and a root of x3 + x + 1

• The generator polynomial g(x) = x3 + x + 1

• The code has length 7.

• A polynomial v(x) = v0 + v1x + v2x2 + · · · + v6x6 is a code polynomial ⇐⇒ v(x) is a


multiple of g(x) ⇐⇒ α is a root of v(x) ⇐⇒ v(α) = 0

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 7


Contd…

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 8


Exercise

• Construct a GF(24) with generator polynomial of 𝑔 𝑥 = 𝑥 4 + 𝑥 + 1 using primitive


element 𝛼.

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 9


AMRITA VISHWA VIDYAPEETHAM 3/29/2025 10
AMRITA VISHWA VIDYAPEETHAM 3/29/2025 11
Minimal Polynomial

• Binary polynomial has roots which occur in conjugate


sets.
• If β is an element of GF(2m) then its conjugates are β
2𝑟−1
2 4
β , β …… β where r is the smallest integer such
𝑟
that β2 = β
• These distinct conjugates form roots of the
polynomial

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 12


Contd…

• Let 𝛽 be an element in 𝐺𝐹 2𝑚 , and let e be the smallest nonnegative


𝑒
integer such that 𝛽 2 = 𝛽 , then

𝑒−1
𝑖
𝑓 𝑥 = ෑ 𝑥 + 𝛽2
𝑖=0

is an irreducible polynomial over GF(2)

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 13


Power Polynomial 4 tuple
Representation Representation Representation
0 0 0000
1 1 1000
𝛼1 𝛼 0100 𝑝 𝑥 = 1 + 𝑥 + 𝑥4
𝛼2 𝛼2 0010
𝛼3 𝛼3 0001 𝑝(𝛼) = 1 + 𝛼 + 𝛼 4
𝛼4 1+𝛼 1100 𝑝 𝛼 =0
5 2
𝛼 𝛼+𝛼 0110
𝛼6 𝛼2 + 𝛼3 0011 1 + 𝛼 + 𝛼4 = 0
𝛼7 1 + 𝛼 + 𝛼3 1101 𝛼4 = 1 + 𝛼
𝛼8 1 + 𝛼2 1010
𝛼9 𝛼 + 𝛼3 0101 𝛼 5 = 𝛼 4. 𝛼1 = 1 + 𝛼 𝛼 = 𝛼 + 𝛼 2
𝛼10 1 + 𝛼 + 𝛼2 1110
𝛼 6 = 𝛼 4. 𝛼 2 = 1 + 𝛼 𝛼 2 = 𝛼 2 + 𝛼 3
𝛼11 𝛼 + 𝛼2 + 𝛼3 0111
𝛼12 1 + 𝛼 + 𝛼2 + 𝛼3 1111 𝛼7 = 𝛼4. 𝛼3 = 1 + 𝛼 𝛼3 = 𝛼3 + 𝛼4
𝛼13 1 + 𝛼2 + 𝛼3 1011 = 𝛼 3 + (1 + 𝛼)
𝛼14 1 + 𝛼3 1001
AMRITA VISHWA VIDYAPEETHAM 3/29/2025 14
Power Polynomial 4 tuple
Minimal polynomials in GF(24) Representatio Representatio Representatio
Field Elements Minimal Polynomials n n n
0 𝑥 0 0 0000
1 1 1000
1 𝑥+1
𝛼1 𝛼 0100
𝟐 𝟒 𝟖 4
𝜶, 𝜶 , 𝜶 , 𝜶 𝑥 +𝑥+1 𝛼2 𝛼2 0010

𝜶𝟑 , 𝜶𝟔 , 𝑥4 + 𝑥3 + 𝑥2 + 𝑥 + 1 𝛼3 𝛼3 0001
𝛼4 1+𝛼 1100
𝜶𝟏𝟐 , 𝛼5 𝛼 + 𝛼2 0110
𝜶𝟗 = 𝜶𝟐𝟒 𝛼6 𝛼2 + 𝛼3 0011

𝑥2 + 𝑥 + 1 𝛼7 1 + 𝛼 + 𝛼3 1101
𝜶𝟓 , 𝜶𝟏𝟎
𝛼8 1 + 𝛼2 1010
𝜶𝟕 , 𝜶𝟏𝟒 , 𝑥4 + 𝑥3 + 1 𝛼9 𝛼 + 𝛼3 0101
𝜶𝟐𝟖 = 𝜶𝟏𝟑 , 𝛼10 1 + 𝛼 + 𝛼2 1110
𝛼11 𝛼 + 𝛼2 + 𝛼3 0111
𝜶𝟓𝟔 = 𝜶𝟏𝟏 ,
𝛼12 1 + 𝛼 + 𝛼 2 + 𝛼 3 1111
𝛼13 1 + 𝛼2 + 𝛼3 1011
𝛼14 1 + 𝛼3 1001
Consider the Galois Field 𝐺𝐹 24 . Let 𝛽 = 𝛼 3 .
Determine the Conjugates of 𝛽 and minimal polynomial.
Conjugates of 𝛽 are
2 3
𝛽2 = 𝛼 6 , 𝛽 2 = 𝛼12 , 𝛽 2 = 𝛼 24 = 𝛼 9
1 2 3
𝜑 𝑥 = (𝑥 + 𝛽)(𝑥 + 𝛽 2 )(𝑥 + 𝛽2 ))(𝑥 + 𝛽 2 )
𝜑 𝑥 = (𝑥 + 𝛼 3 )(𝑥 + 𝛼 6 )(𝑥 + 𝛼12 ))(𝑥 + 𝛼 9 )
= (𝑥 2 + 𝛼 2 𝑥 + 𝛼 9 )(𝑥 2 + 𝛼 8 𝑥 + 𝛼 6 )
= 𝑥 4 + 𝛼 2 + 𝛼 8 𝑥 3 + (𝛼 6 +𝛼 9 + 𝛼10 𝑥 2 + (𝛼 8 +𝛼17 )𝑥 + 𝛼15 )
= 𝑥4 + 𝑥3 + 𝑥2 + 𝑥 + 1

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 16


Example

• Let 𝛼 be the primitive element of GF(24) such that 1 + 𝛼 + 𝛼 4 = 0, determine the


generator polynomial for double error correcting BCH code.

Solution:

Given m=4, and t=2

𝑛 = 2𝑚 − 1 = 15

Message length 𝑘 = 𝑛 − 𝑚𝑡 = 17

minimum distance 𝑑_ min = 2𝑡 + 1 = 5

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 17


Contd..

• Generator polynomial g(x) is given by

• Here, 𝑔 𝑥 = 𝐿𝐶𝑀{Φ1 𝑥 , Φ2 𝑥 , Φ3 𝑥 , Φ4 𝑥 }

• By considering only odd terms

𝑔 𝑥 = 𝐿𝐶𝑀{Φ1 𝑥 , Φ3 𝑥 }
𝑔 𝑥 = 1 + 𝑥 + 𝑥 4 (1 + 𝑥 + 𝑥 2 + 𝑥 3 + 𝑥 4 )
𝑔 𝑥 = 1 + x + x 2 + x 3 + x 4 + x + x 2 + x 3 + x 4 + x 5 + x 4 + x 5 + x 6 + +x 7 + x 8
𝑔 𝑥 = 1 + x4 + x6 + x7 + x8

AMRITA VISHWA VIDYAPEETHAM 3/29/2025 18


AMRITA VISHWA VIDYAPEETHAM 3/29/2025 19

You might also like