Fire Codes Minimun Polynomials Bose-Chaudhuri-Hocquenghem Codes Reed-Solomon Codes

FIRE CODES
MINIMUN POLYNOMIALS
BOSE-CHAUDHURI-HOCQUENGHEM CODES
REED-SOLOMON CODES
Juan Astudillo, Miguel Davila y Gustavo
Delgado
FIRE CODES
FIRE CODES
 Fire Code can correct single-burst errors in code vectors.
 Definition: A Fire code is a cyclic code with a generator

polynomial of the form:
 Where p(x) is an irreducible polynomial over B of

degree m, whose roots have order r and c is not
divisible by r
FIRE CODES
 The length n of the code words in a Fire Code is
the least commom multiple of c and r, the number
of parity check bits is c+m and the number of
information bits is n-c-m.
 The code is capable correcting a single burst of

length b and simultaneously detecting a burst of
length:
FIRE CODES
Example
 We have seen that is irreducible over B and
that the order of its roots is 3. We can use this polynomial
to construct a generator polynomial for a Fire code by
multiplying it by to give:
 In this case, we have c=4, m=2 and r=3. The code has code
words that are twelve bits long, with six information bits
and six parity check bits. It can correct bursts up to two bits
long.
FIRE CODES
 Its generator matrix is:
FIRE CODES
Example
 It is easy to construct Fire codes with long code
words. Considerer:
 is irreducible over B, and the order of

its roots is 127.
FIRE CODES
 We therefore have m=7, r=127 and c=8. The least
commom of c and is 8*127=1016.
 The code has code words that are 1016 bits long,
with 15 parity check bits and 1001 information
bits.
 It can be correct bursts up to seven bits long.

Minimum Polynomials
MINIMUM POLYNOMIALS
 Let F be any field. For any , the polynomial (X-a) has a
as zero. It is irreducible over F.
 If is irreducible over F, and the degree of p(X) is

greater than 1, then F(X)/p(X) is field in which the coset of
X is a zero of p(X).
 There may be many polynomials that have a given zero, some

of which are irreducible and some of which are not. Of
these, there is one special polynomial that has the smallest
degree. To specify it, we need the following definitions.
MINIMUM POLYNOMIALS
 Extension Field: Let F and G be two fields. G is
an extension field of F if there exists a ring
isomorphism from F onto a subset of G.
 Monic Polynomial: A polynomial of degree

in which the coefficient of is 1 is a monic
polynomial.
MINIMUM POLYNOMIALS
 Minimum Polynomial: Let F be a field, and let a
belong either to F or an extension field of F.
 If is an irreducible monic polynomial of

which a is a zero, and there is no polynomial of lesser
degree of which a is a zero, then p(X) is the minimum
polynomial of a over F.
 Note that if p(X) is the minimum polynomial of a over F,

then p(X) will be a factor of any other polynomial of
which a is a zero.
MINIMUM POLYNOMIALS
 Example
BOSE-CHAUDHURI-HOCQUENGHEM
CODES
 Bose-Chaudhuri-Hocquenghem (BCH) codes are

cyclic codes whose generator polynomial has
been chosen to make the distance between code
words large, and for which effective decoding
procedures have been devised.
 The construction of BCH codes uses roots of

unity.
 Definition: nth Root of Unity: Let F be a field. An n th

root of unity is a zero of the polynomial:
1 is obviously always an n th th root of unity, but in

most cases, the roots of unity will not belong to F, but
to some extension field of F. For a Galois field GF(p)
there will be some m such that the nth roots of unity
belong to . In this case, n must divide .
(This means that n and p cannot have any common
factors.)
Example:
 The 3rd roots of unity of B have n=3,p=2. Since 2^2-
1=3, we have m=2. The roots of unity are the

three non-zero elements of Galois field. Since
 the minimum polynomial of 1 is (X+1) and the

minimum polynomial of the other roots of unity is
 The zeros of are primitive roots of

unity in B.
 Definition: Least Common Multiple: The least

common multiple of a set of polynomials is the
polynomial of minimum degree that is divisible by
all the polynomials in the set.
Example:
 In the least common multiple of X and (X+1)
is
 The least common multiple of (X+1) and
 since (X+1) divides

 The least common multiple of
can be found by finding the factors of these
polynomials and multiplying together those that
appear in at least one of the polynomials.
 Since
 their least common multiple is given by

 Definition: Bose-Chaudhuri-Hocquenghem
(BCH) Code: A Bose-Chaudhuri-Hocquenghem
(BCH) code is a cyclic code of length n whose
generator polynomial is the least common
multiple of the minimal polynomials of successive
powers of a primitive n th root of unity in B.
 From the above, there is some m such that

contains a root of unity in B.
 are positive integers, then
 are successive powers of a. Each of these powers will

have a minimal polynomial in B[X].
 The least common multiple of these minimal

polynomials will be the generator polynomial of
a cyclic code whose minimum distance will be no
less than .
 is the designed distance of the code.
 The most important BCH codes are obtained by

taking b=1.
 It can be shown that for any positive integers m

and t, there is a BCH binary code of length
which corrects all combinations of t or fewer errors
and has no more than mt parity check bits. In
particular, the code will correct bursts of length t
or less.
Example
 is irreducible over B. If we
let a be the coset of X in B[X]/p(X), and take m=3,
b=1 and = 3, we get BCH code whose code
words are 7 bits long.
 The generator polynomial of this code is the

polynomial in B[X] of minimal degree whose
roots include
 The polynomial has this property, since
 The generator matrix of the code is
 The code has three information bits and four parity

check bits.
Reed-Solomon Codes
Reed-Solomon Codes
 Definition: Reed-Solomon Codes: A Reed-
Solomon code is a BCH code with parameters m=1
and b=1.
 Reed-Solomon codes are an important subclass of

BCH codes. They are constructed in the following
manner. Let F be a finite field, and let n be the
order of that is, The polynomial
Reed-Solomon Codes
 The generator polynomial of a code whose words
have n digits (d-1) parity check digits and
minimum distance d.
Reed-Solomon Codes
 Example
 In if a denotes the coset of X,
. If we take d=4, our generator polynomial

is
 If we rename the elements of

with the digits 0,1,2,3,4,5,6,7 the generator
polynomial is
Reed-Solomon Codes
 and we have a generator matrix
 For a code on {0,1,….,7}

 If we express the digits in the generator matrix in
binary notation, we get the generator matrix for a
binary code with code words that are 21 bits long:
Reed-Solomon Codes
 Note that if G is used to generate code words, the

operations of with the elements
suitably renamed, must be used in the
computations.
Reed-Solomon Codes
Reed-Solomon Codes
Reed-Solomon Codes

Fire Codes Minimun Polynomials Bose-Chaudhuri-Hocquenghem Codes Reed-Solomon Codes

Uploaded by

Copyright:

Available Formats

Fire Codes Minimun Polynomials Bose-Chaudhuri-Hocquenghem Codes Reed-Solomon Codes

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Fire Codes Minimun Polynomials Bose-Chaudhuri-Hocquenghem Codes Reed-Solomon Codes

Uploaded by

Copyright:

Available Formats

FIRE CODES

 Definition: A Fire code is a cyclic code with a generator

 Where p(x) is an irreducible polynomial over B of

 The code is capable correcting a single burst of

 is irreducible over B, and the order of

 It can be correct bursts up to seven bits long.

 If is irreducible over F, and the degree of p(X) is

 There may be many polynomials that have a given zero, some

 Monic Polynomial: A polynomial of degree

 If is an irreducible monic polynomial of

 Note that if p(X) is the minimum polynomial of a over F,

 Bose-Chaudhuri-Hocquenghem (BCH) codes are

 The construction of BCH codes uses roots of

 Definition: nth Root of Unity: Let F be a field. An n th

1 is obviously always an n th th root of unity, but in

1=3, we have m=2. The roots of unity are the

 the minimum polynomial of 1 is (X+1) and the

 The zeros of are primitive roots of

 Definition: Least Common Multiple: The least

 The least common multiple of (X+1) and

 since (X+1) divides

 their least common multiple is given by

 From the above, there is some m such that

 are positive integers, then

 are successive powers of a. Each of these powers will

 The least common multiple of these minimal

 is the designed distance of the code.

 The most important BCH codes are obtained by

 It can be shown that for any positive integers m

 The generator polynomial of this code is the

 The polynomial has this property, since

 The generator matrix of the code is

 The code has three information bits and four parity

 Reed-Solomon codes are an important subclass of

. If we take d=4, our generator polynomial

 If we rename the elements of

 For a code on {0,1,….,7}

 Note that if G is used to generate code words, the

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.