0% found this document useful (0 votes)
19 views3 pages

CC - FiniteFields

This document discusses finite fields and their properties. It contains the following key points: 1. A finite field is a set with a finite number of elements that is closed under addition, subtraction, multiplication, and division. It satisfies the properties of a field. 2. The integers modulo a prime number p form a finite field, called the prime field or Galois field GF(p). All elements have a multiplicative inverse. 3. Larger finite fields can be constructed by considering polynomials with coefficients from a smaller finite field. The coefficients of such polynomials must come from the smaller base field.

Uploaded by

Aparna Sivakumar
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
0% found this document useful (0 votes)
19 views3 pages

CC - FiniteFields

This document discusses finite fields and their properties. It contains the following key points: 1. A finite field is a set with a finite number of elements that is closed under addition, subtraction, multiplication, and division. It satisfies the properties of a field. 2. The integers modulo a prime number p form a finite field, called the prime field or Galois field GF(p). All elements have a multiplicative inverse. 3. Larger finite fields can be constructed by considering polynomials with coefficients from a smaller finite field. The coefficients of such polynomials must come from the smaller base field.

Uploaded by

Aparna Sivakumar
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/ 3

Chapters FiniteField's takethebookonwednesday

teratureRothchapter 3 FiniteFields IITmadrasNotes


apter useBangioreNotes Howtofindone
eedSolomoncodemostwidelyused a PrimeFactonsation
todesigncodessandng
itefieldstheoryofAlgebra DEualidsAlgorithm
cycliccodes
Bag most
needit Definition set F with 2 binaryoperations
90125codeuses
Finitefeed Finite TÉ abeliangroupcommutative have
o IdentityeleggedEd
s
a s Identityelement
multiplicative
start
end makes
they.hn echo held add subtract multiply
pyrites need
a lb c abt ac
Toy PrototypeExampleofafiniteFeedexample
R it i I
eg Ip o I s
p23 t modp
p prime
Tetonof all polynomials in ishavingreal Multiplicativeinverse istricky
coefficients
FNota commoninverse
exist andtofind
guy m
over the real numbers eachcase
Integeraddition Integermultiplication 7
modulooperationis also
g p same
and when m 2 Zp
setofintegersmodulop whenmes
Zp isfinitefield
ofsize p
when
m et
Rex be almonic irreducible polynomial
of degree m over Ip

monic mean
fac Effi x

is monic when
pen
FMFostyassumedwhenis
areducablepolynomial

Pex gopher where degreesofboth


09 deg Cga deg hor
degfee
p 2 degreed
d s x set I
Xxx 1
3 x a 3 2 2
3
4 Txt 1 X4 3 1 X4 3 I
4
inte fields groupsandprimefield
mostly forcalculationsdoneoverbas a a e
I To element 2
2 identity
soups Non empty set ofelements A a b c but
also operation gets also agroup
doubtfromthe Lecture 2.0 0
Definition is already inbook
I 2,33
mod4
2 mode
A o I 2,33 a i
g group undermines Finitefield's
2 Closure Catb mod4 E is an example
ofÉÉÉÉÉÉ
It satisfies
and modp and modp is alpinee field

mmm m 5 O 22 3 43modules
Catb to mody ayygmody Commutatitatevegroup r
It 1,2 3 43
B Identity e a a e e a EA and Identity I e
and multiplicative inverse 1.2 2mods
Ota atomod emos
2.1 2
multiplicative of 33 emo
Inverse Al a 4 4 inverse
and hence a 3
a 3 4 4 16model
and.no and hence If is a finitePomefield
Cat'Smod4 42L quizChannelcoding
a No O I 2,3 agroupunderregularad
g LN I 2 3 usual addition
down
Identityelement atc inverse o to o
gg notthere

iaas
verse element
at a ate
Identity
itself and Field groupandfieldproperties
elds Definition isalreadyin thebook If 2 53mod6
O I modules is afield multiplicative inverse 2 2 7 amode
g E mode
addition multiplication 2 3 6 o
2
here
commutative Munderaddition
1,8
aregroup multiplicative 2 5 7 10 4

whether A 0 2 2 33modulo 4 isnoted


c
13 7 primitiveelement z
nd t all holds
at 1 F 2,2 33 mod4
µ
niteFields Extensionheld
Howtoconstruct afinitefieldof
I conclusionBox
b Xkomodxb
4 is not a offer xb Ex modx
poumenfice

9 0 1 2,33
modulo 4 is not a field O FIX modCen D set somodCan D
Un s
173
nd 7 This iscalledextensionfield

along it can beanyField


if we write
b IFCx is the set ofpolynomialswith
coefficientsfromIF

5pm denotes anextensionfield ofthe


C
base field Ip Fp Fpm
d p isprime and the integer my
is called extensiondegree

olynomials over finite fields


IF Ex x It
13 O I 23mod3 Poe
I
mpotanttmng.fi I
15polynomial impliesthat thecoefficient of
pod should be in 153 o 1,2
I Nodegree constraints pleasedon't compare
value
with the degree candegree haven

ex x
Emffferentwayof
writing
Ez x R the coefficients in these
pol nomial
should
notonly
It mod2
mydoubthere say o I 2,33mod4
a field v
Ty is not
then
we say
por É Egx
polynomials arecalculated
modx2
a x 5 txt x 3
FIX at at a 23.7 He
IT X T É
omode
andhence
if

You might also like