ECEN 5682 Theory and Practice of Error Control Codes
|
|
- Stuart Preston
- 6 years ago
- Views:
Transcription
1 ECEN 5682 Theory and Practice of Error Control Codes Introduction to Algebra University of Colorado Spring 2007
2 Motivation and For convolutional codes it was convenient to express the datawords and the codewords in the form of power series and to use generator polynomials to compute the code power series from the data power series. A similar approach, using polynomials instead of power series, can be used to generate a class of blockcodes known as cyclic codes. Definition: The polynomial f (x) associated with the vector f = (f 0, f 1,..., f N 1 ) is f (x) = f 0 + f 1 x f N 1 x N 1. Definition: Let u = (u 0, u 1,... u k 1 ) be a dataword of a (n, k) blockcode. Then the polynomial u(x) = u 0 + u 1 x u k 1 x k 1, with deg u(x) k 1, associated with u is called the corresponding data polynomial.
3 Definition: Let c = (c 0, c 1,... c n 1 ) be a codeword of a (n, k) blockcode. Then the polynomial c(x) = c 0 + c 1 x c n 1 x n 1, with deg c(x) n 1, associated with c is called the corresponding code polynomial. Definition: A q-ary generator polynomial of degree n k is a polynomial in x of the form g(x) = g 0 + g g n k x n k, g 0, g n k 0, with n k + 1 q-ary coefficients g i. Definition: The q-ary (n, k) blockcode C generated by the q-ary generator polynomial g(x) of degree n k is the set of all code polynomials c(x) = u(x) g(x), which is obtained from the set of all possible q-ary data polynomials u(x) with deg u(x) k 1.
4 Example: Let q = 2 and g(x) = 1 + x 2 + x 3 + x 4. Using c(x) = u(x) g(x), the following codewords are obtained: u(x) c(x) = 1 + x 2 + x 3 + x 4 = g(x) 01 = x = x g(x) right shift 11 = 1 + x = g(x) + x g(x) x 7 = (1 + x 2 + x 3 )(1 + x 2 + x 3 + x 4 )
5 The set of codewords from the first 8 rows C = { , , , , , , , } make up a cyclic (i.e., if c is a codeword, then its cyclic shifts are also codewords) binary (7, 3, 4) code. The whole set of 16 codewords, however, only makes up a (non-cyclic) binary (8, 4, 2) code, where the reduction in minimum distance from 4 to 2 comes from u = (1011) c = ( ). Definition: A polynomial with q-ary coefficients is called irreducible if it cannot be factored into two or more smaller degree polynomials with q-ary coefficients.
6 Example: (contd.) From the computation of c(x) = u(x) g(x) above it can be deduced that, using modulo 2 arithmetic for polynomial coefficients, x 7 +1 = (x 3 +x 2 +1) (x 4 + x 3 + x 2 + 1) {z } = (x +1) (x 3 +x +1) (x 3 +x 2 +1), = (x + 1)(x 3 + x + 1) where all three polynomials in the last expression are irreducible modulo 2. Such polynomials are useful for constructing extension fields. Let p(x) = x 3 + x + 1 and define the element α by 0 = p(α) = α 3 + α + 1 = α 3 = α + 1. Note that, using regular arithmetic, one would have obtained α 3 = (α + 1), but because all coefficients are taken modulo 2, minus and plus are the same.
7 Multiplying repeatedly by α and using the reduction α 3 = α + 1 whenever necessary results in the following elements: α 3 = α + 1, α 4 = α 2 + α, α 5 = α 3 + α 2 = α 2 + α + 1, α 6 = α 3 + α 2 + α = α 2 + 1, α 7 = α 3 + α = 1 = α 0. After adding the zero element this becomes the set of 2 3 = 8 elements F = {0, 1, α, α 2, α 3, α 4, α 5, α 6 }. Each element can be expressed as a polynomial of degree at most two with binary coefficients and indeterminate α. Therefore, using modulo 2 polynomial addition, one can easily set up an addition table for the elements in F. Similarly, a multiplication table is easily obtained from the power of α representation of the non-zero elements in F.
8 The addition table is α α 2 α 3 α 4 α 5 α α α 2 α 3 α 4 α 5 α α 3 α 6 α α 5 α 4 α 2 α α α 3 0 α 4 1 α 2 α 6 α 5 α 2 α 2 α 6 α 4 0 α 5 α α 3 1 α 3 α 3 α 1 α 5 0 α 6 α 2 α 4 α 4 α 4 α 5 α 2 α α α 3 α 5 α 5 α 4 α 6 α 3 α α α 6 α 6 α 2 α 5 1 α 4 α 3 α 0 Because of the all-zero main diagonal in the addition table each element is equal to its additive inverse, i.e., α i = α i for i = 0, 1,..., 6.
9 The multiplication table is 0 1 α α 2 α 3 α 4 α 5 α α α 2 α 3 α 4 α 5 α 6 α 0 α α 2 α 3 α 4 α 5 α 6 1 α 2 0 α 2 α 3 α 4 α 5 α 6 1 α α 3 0 α 3 α 4 α 5 α 6 1 α α 2 α 4 0 α 4 α 5 α 6 1 α α 2 α 3 α 5 0 α 5 α 6 1 α α 2 α 3 α 4 α 6 0 α 6 1 α α 2 α 3 α 4 α 5 Using the fact that α 7 = α 0, one can find multiplicative inverses for all non-zero elements quite easily using α j = α 7 j for j = 1, 2,..., 6.
10 Groups, Rings, Fields Over the reals R (or the rationals Q, or the complex numbers C) one can add, subtract, multiply and divide. In modern algebra the following arithmetic systems are distinguished: Group: Set of mathematical objects for which addition and subtraction are defined. Ring: Set of mathematical objects for which addition, subtraction and multiplication are defined. Field: Set of mathematical objects for which addition, subtraction, multiplication and division are defined. Note that addition, subtraction, multiplication and division need not be the usual +,,, and.
11 Definition: A set S is an arbitrary collection of objects or elements, without any predefined operations between set elements. Definition: The cardinality S of a set S is the number of objects contained in the set. The cardinality of a set can be finite, countably infinite, or uncountably inifinite. Examples: The set of tea cups in your kitchen is (almost certainly) a finite set. The set of all rational numbers Q is countably infinite. The set of all real numbers R is uncountably infinite.
12 Let S denote a set of mathematical objects. Then, for any a, b, c S, the following axioms can be defined: (A.1) a + b S Closure wrt + (A.2) a + (b + c) = (a + b) + c = a + b + c Associativity wrt + (A.3) a + 0 = 0 + a = a, 0 S Identity element wrt + (A.4) a + ( a) = ( a) + a = 0, ( a) S Inverse element wrt + (A.5) a + b = b + a Commutativity wrt + (B.1) a b S Closure wrt (B.2) a (b c) = (a b) c = a b c Associativity wrt (B.3) a 1 = 1 a = a, 1 S {0} Identity element wrt (B.4) a (a 1 ) = (a 1 ) a = 1, a, (a 1 ) S {0} Inverse element wrt (B.5) a b = b a Commutativity wrt (C.1) (a + b) c = a c + b c Distributivity c (a + b) = c a + c b
13 Depending on the subset of axioms which are satisfied, the following arithmetic systems can be defined: Axioms satisfied (A.1)...(A.4) (A.1)...(A.4),(A.5) (A.1)...(A.5),(B.1)...(B.3),(C.1) (A.1)...(A.5),(B.1)...(B.3),(B.5),(C.1) (A.1)...(A.5),(B.1)...(B.5),(C.1) Name Group Commutative (Abelian) Group Ring with Identity Commutative Ring with Identity Field Note: Commutative groups (rings, fields) are also called Abelian groups (rings, fields) in honor of Niels Henrik Abel ( ). Notation: A group with set of elements G and operation is denoted by <G, >. A ring with set of elements R, first operation + and second operation is denoted by <R, +, >. Similarly, a field with set of elements F, first operation + and second operation is denoted by <F, +, >.
14 Definition: If G (or R or F ) in <G, > (or <R, +, > or <F, +, >) has finite cardinality, then <G, > is a finite group (or <R, +, > is a finite ring, or <F, +, > is a finite field). In this case the number of elements in G (or R or F ) denoted G (or R or F ) is called the order of G (or R or F ). Example: The set of all even integers form a group under the operation of (usual) addition. The number of elements in this group is countably infinite. Example: Let G = {1, 2, 3, 4, 5, 6} and let denote multiplication modulo 7. Then <G, > is a finite group of order G = 6. Example: The set of all polynomials in the indeterminate x with integer coefficients form a commutative ring with identity under the operations of (usual) polynomial addition and multiplication. Because polynomials must have a finite degree, this ring has a countably infinite number of elements.
15 Example: The set of all complex numbers together with complex addition and multiplication forms a field with an uncountably infinite number of elements. Example: The integers 0, 1,..., 6 form a finite field (called GF (7), where GF stands for Galois field in honor of Evariste Galois ( )) under the operations of addition and multiplication modulo 7. Here are the group operation tables for GF (7):
16 Definition: Isomorphism. Two groups <G, +> and <G, > are isomorphic if a one-to-one mapping f (.) exists such that (i) a = f (a) (and thus a = f 1 (a )) for all a G and a G, (ii) if a = f (a), b = f (b), then a b = f (a + b) (and thus a + b = f 1 (a b )), for any a, b G and any a, b G. That is, there has to be a one-to-one correspondence between the elements of the two groups, which is preserved under the group operations + and of the respective groups. Note: Isomorphism for rings and fields is defined analogously. The one-to-one correspondence in this case must be preserved for both operations of the respective rings or fields.
17 Example: The elements G = {1, 2, 4, 8, 11, 16} form a group of order 6 under the operation of multiplication modulo 21, denoted by. Similarly, the elements G = {1, 2, 3, 4, 5, 6} form a group of order 6 under which denotes multiplication modulo 7. The two group operation tables are Multiplication modulo Multiplication modulo Using the mapping a = f (a) from G to G 1 = f (1), 2 = f (4), 3 = f (2), 4 = f (16), 5 = f (11), 6 = f (8), it is not difficult to see that <G, > and <G, > are isomorphic.
18 Definition: Let <G, > be a group and let H be a nonempty subset of G. Then H is called a subgroup of G if <H, > is a group. Example: Let <G, > be the elements G = {1, 2, 3, 4, 5, 6} under the operation of multiplication modulo 7. Then H = {1, 2, 4} is a subgroup and it is easily verified that <H, > satisfies all the axioms of a group. Definition: Let <R, +, > be a ring and let H be a nonempty subset of R. Then H is called a subring of R if <H, +, > is a ring. Note: In particular, identity with respect to first operation must be in H and closure must hold (under all specified operations) for elements in H. Definition: Let <E, +, > be a field. Then F E is called a subfield of E if <F, +, > is a field. The field E is then called an extension field of F.
19 Example: Consider the field of rational numbers Q, the field of real numbers R, and the field of complex numbers C. Then Q R C, and thus Q is a subfield of R and C is an extension field of R. To obtain a subgroup H of a finite group <G, >, one can proceed as follows. Take any h G and let H be the set {h, h h, h h h,...}, or, using a more concise notation, H = {h, h 2, h 3,..., h c = 1}, where c = H is the smallest positive integer such that h c = 1. Example: Consider the group G = {1, 2,..., 12} of integers under the operation of multiplication modulo 13. Picking h = 3 results in the set H = {5 1 = 5, 5 2 = 12, 5 3 = 8, 5 4 = 1}, which forms a subgroup of G of order 4.
20 Theorem: If G is a finite group and h G, then a smallest positive integer c, called the order of the element h, exists such that h c = 1. Moreover, the first element in the sequence h, h 2, h 3,... which is repeated is h itself. Proof: The element h is a member of a finite group and thus a repetition must eventually occur in h, h 2, h 3,..., that is, it must be true that h k = h m, m > k, for two positive integers k and m. Since the element h k must be in G, one can write 1 = h k h k = h m h k = h m k, which proves that there is at least one positive integer c such that h c = 1. But then h c+1 = h and, since h, h 2,..., h c must all be distinct (otherwise c is not smallest positive integer such that h c = 1), h is the first element which is repeated. QED
21 Definition: h, h 2, h 3,..., h c = 1 is called a cycle. Note: A cycle is a subgroup. Definition: A group that consists of all the powers of one of its elements, say, α, is called a cyclic group (i.e., G = {α, α 2,..., α c = 1}). The element α is called a primitive element or a generator of the group. Example: Let <G, > be the set of integers under multiplication modulo 13. Then, choosing α = 2, one obtains α 0 = 1 α 4 = 3 α 8 = 9 α 12 = 1 α 1 = 2 α 5 = 6 α 9 = 5 α 2 = 4 α 6 = 12 α 10 = 10 α 3 = 8 α 7 = 11 α 11 = 7 Thus, <G, > is a cyclic group and α = 2 is a primitive element in this group.
22 Coset Decomposition. Given a finite group <G, > and a subgroup <H, >, H = {h 1, h 2,..., h n } G, one can decompose G with respect to H as follows: h 1 = 1 h 2 h 3... h n g 2 h 1 = g 2 g 2 h 2 g 2 h 3... g 2 h n g 3 h 1 = g 3 g 3 h 2 g 3 h 3... g 3 h n g m h 1 = g m g m h 2 g m h 3... g m h n The rows of the coset decomposition are called cosets. The first row is the subgroup H. The elements h 1, g 2, g 3,..., g m in the first column are called coset leaders.
23 The construction of the array proceeds as follows: (1) Start with the elements of H in the first row (each element occurs exactly once). (2) Choose an (arbitrary) element of G which does not yet appear in the table as coset leader and complete the coset. Repeat this step until all elements of G are used. Note that the array constructed in this way is always rectangular and the construction always stops since G is finite. For non-abelian groups one distinguishes a left coset decomposition with elements g i h j from a right coset decomposition with elements h j g i. Note: The standard array used for (conceptual) decoding of received n-tuples of a q-ary linear code is a coset decomposition. In this case the subset H is the set of all codewords of the code and the group operation is vector addition modulo q.
24 Example: Let < G, > be the group of integers G = {1, 2,..., 12} under the operation of multiplication modulo 13. A coset decomposition of G with respect to the subgroup H = {1, 3, 9} is Coset leaders Subgroup H Cosets
ECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationChapter 4 Mathematics of Cryptography
Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationSample algebra qualifying exam
Sample algebra qualifying exam University of Hawai i at Mānoa Spring 2016 2 Part I 1. Group theory In this section, D n and C n denote, respectively, the symmetry group of the regular n-gon (of order 2n)
More informationChapter 4 Finite Fields
Chapter 4 Finite Fields Introduction will now introduce finite fields of increasing importance in cryptography AES, Elliptic Curve, IDEA, Public Key concern operations on numbers what constitutes a number
More informationFields in Cryptography. Çetin Kaya Koç Winter / 30
Fields in Cryptography http://koclab.org Çetin Kaya Koç Winter 2017 1 / 30 Field Axioms Fields in Cryptography A field F consists of a set S and two operations which we will call addition and multiplication,
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationB. Cyclic Codes. Primitive polynomials are the generator polynomials of cyclic codes.
B. Cyclic Codes A cyclic code is a linear block code with the further property that a shift of a codeword results in another codeword. These are based on polynomials whose elements are coefficients from
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationNumber Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.
Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)
More informationAlgebra: Groups. Group Theory a. Examples of Groups. groups. The inverse of a is simply a, which exists.
Group Theory a Let G be a set and be a binary operation on G. (G, ) is called a group if it satisfies the following. 1. For all a, b G, a b G (closure). 2. For all a, b, c G, a (b c) = (a b) c (associativity).
More information55 Separable Extensions
55 Separable Extensions In 54, we established the foundations of Galois theory, but we have no handy criterion for determining whether a given field extension is Galois or not. Even in the quite simple
More informationMT5836 Galois Theory MRQ
MT5836 Galois Theory MRQ May 3, 2017 Contents Introduction 3 Structure of the lecture course............................... 4 Recommended texts..................................... 4 1 Rings, Fields and
More informationCommutative Rings and Fields
Commutative Rings and Fields 1-22-2017 Different algebraic systems are used in linear algebra. The most important are commutative rings with identity and fields. Definition. A ring is a set R with two
More informationFields and Galois Theory
Fields and Galois Theory Rachel Epstein September 12, 2006 All proofs are omitted here. They may be found in Fraleigh s A First Course in Abstract Algebra as well as many other algebra and Galois theory
More informationGenerator Matrix. Theorem 6: If the generator polynomial g(x) of C has degree n-k then C is an [n,k]-cyclic code. If g(x) = a 0. a 1 a n k 1.
Cyclic Codes II Generator Matrix We would now like to consider how the ideas we have previously discussed for linear codes are interpreted in this polynomial version of cyclic codes. Theorem 6: If the
More informationMATH 433 Applied Algebra Lecture 22: Review for Exam 2.
MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric
More informationPage Points Possible Points. Total 200
Instructions: 1. The point value of each exercise occurs adjacent to the problem. 2. No books or notes or calculators are allowed. Page Points Possible Points 2 20 3 20 4 18 5 18 6 24 7 18 8 24 9 20 10
More informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More informationAbstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications
1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the
More informationRings. EE 387, Notes 7, Handout #10
Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for
More informationCDM. Finite Fields. Klaus Sutner Carnegie Mellon University. Fall 2018
CDM Finite Fields Klaus Sutner Carnegie Mellon University Fall 2018 1 Ideals The Structure theorem Where Are We? 3 We know that every finite field carries two apparently separate structures: additive and
More informationSchool of Mathematics and Statistics. MT5836 Galois Theory. Handout 0: Course Information
MRQ 2017 School of Mathematics and Statistics MT5836 Galois Theory Handout 0: Course Information Lecturer: Martyn Quick, Room 326. Prerequisite: MT3505 (or MT4517) Rings & Fields Lectures: Tutorials: Mon
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
More informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationALGEBRA QUALIFYING EXAM SPRING 2012
ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.
More informationALGEBRA 11: Galois theory
Galois extensions Exercise 11.1 (!). Consider a polynomial P (t) K[t] of degree n with coefficients in a field K that has n distinct roots in K. Prove that the ring K[t]/P of residues modulo P is isomorphic
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationCoding Theory and Applications. Solved Exercises and Problems of Cyclic Codes. Enes Pasalic University of Primorska Koper, 2013
Coding Theory and Applications Solved Exercises and Problems of Cyclic Codes Enes Pasalic University of Primorska Koper, 2013 Contents 1 Preface 3 2 Problems 4 2 1 Preface This is a collection of solved
More informationSUPPLEMENTARY NOTES: CHAPTER 1
SUPPLEMENTARY NOTES: CHAPTER 1 1. Groups A group G is a set with single binary operation which takes two elements a, b G and produces a third, denoted ab and generally called their product. (Mathspeak:
More informationOutline. We will now investigate the structure of this important set.
The Reals Outline As we have seen, the set of real numbers, R, has cardinality c. This doesn't tell us very much about the reals, since there are many sets with this cardinality and cardinality doesn't
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationGroups. Contents of the lecture. Sergei Silvestrov. Spring term 2011, Lecture 8
Groups Sergei Silvestrov Spring term 2011, Lecture 8 Contents of the lecture Binary operations and binary structures. Groups - a special important type of binary structures. Isomorphisms of binary structures.
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationGroups. s t or s t or even st rather than f(s,t).
Groups Definition. A binary operation on a set S is a function which takes a pair of elements s,t S and produces another element f(s,t) S. That is, a binary operation is a function f : S S S. Binary operations
More informationMany of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation.
12. Rings 1 Rings Many of the groups with which we are familiar are arithmetical in nature, and they tend to share key structures that combine more than one operation. Example: Z, Q, R, and C are an Abelian
More informationFields and Galois Theory. Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory.
Fields and Galois Theory Below are some results dealing with fields, up to and including the fundamental theorem of Galois theory. This should be a reasonably logical ordering, so that a result here should
More informationSection 18 Rings and fields
Section 18 Rings and fields Instructor: Yifan Yang Spring 2007 Motivation Many sets in mathematics have two binary operations (and thus two algebraic structures) For example, the sets Z, Q, R, M n (R)
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationExtension fields II. Sergei Silvestrov. Spring term 2011, Lecture 13
Extension fields II Sergei Silvestrov Spring term 2011, Lecture 13 Abstract Contents of the lecture. Algebraic extensions. Finite fields. Automorphisms of fields. The isomorphism extension theorem. Splitting
More informationCHAPTER 14. Ideals and Factor Rings
CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationFinite Fields. Mike Reiter
1 Finite Fields Mike Reiter reiter@cs.unc.edu Based on Chapter 4 of: W. Stallings. Cryptography and Network Security, Principles and Practices. 3 rd Edition, 2003. Groups 2 A group G, is a set G of elements
More informationUltraproducts of Finite Groups
Ultraproducts of Finite Groups Ben Reid May 11, 010 1 Background 1.1 Ultrafilters Let S be any set, and let P (S) denote the power set of S. We then call ψ P (S) a filter over S if the following conditions
More information7.1 Definitions and Generator Polynomials
Chapter 7 Cyclic Codes Lecture 21, March 29, 2011 7.1 Definitions and Generator Polynomials Cyclic codes are an important class of linear codes for which the encoding and decoding can be efficiently implemented
More informationCOMPUTER ARITHMETIC. 13/05/2010 cryptography - math background pp. 1 / 162
COMPUTER ARITHMETIC 13/05/2010 cryptography - math background pp. 1 / 162 RECALL OF COMPUTER ARITHMETIC computers implement some types of arithmetic for instance, addition, subtratction, multiplication
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More information1 Commutative Rings with Identity
1 Commutative Rings with Identity The first-year courses in (Abstract) Algebra concentrated on Groups: algebraic structures where there is basically one algebraic operation multiplication with the associated
More informationDiscrete Mathematics. Benny George K. September 22, 2011
Discrete Mathematics Benny George K Department of Computer Science and Engineering Indian Institute of Technology Guwahati ben@iitg.ernet.in September 22, 2011 Set Theory Elementary Concepts Let A and
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More information5.0 BCH and Reed-Solomon Codes 5.1 Introduction
5.0 BCH and Reed-Solomon Codes 5.1 Introduction A. Hocquenghem (1959), Codes correcteur d erreurs; Bose and Ray-Chaudhuri (1960), Error Correcting Binary Group Codes; First general family of algebraic
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationLECTURE NOTES IN CRYPTOGRAPHY
1 LECTURE NOTES IN CRYPTOGRAPHY Thomas Johansson 2005/2006 c Thomas Johansson 2006 2 Chapter 1 Abstract algebra and Number theory Before we start the treatment of cryptography we need to review some basic
More informationComputer Algebra for Computer Engineers
p.1/23 Computer Algebra for Computer Engineers Galois Fields: GF(2 m ) Priyank Kalla Department of Electrical and Computer Engineering University of Utah, Salt Lake City p.2/23 Galois Fields A Galois Field
More informationGroups, Rings, and Finite Fields. Andreas Klappenecker. September 12, 2002
Background on Groups, Rings, and Finite Fields Andreas Klappenecker September 12, 2002 A thorough understanding of the Agrawal, Kayal, and Saxena primality test requires some tools from algebra and elementary
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] For
More informationGalois theory of fields
1 Galois theory of fields This first chapter is both a concise introduction to Galois theory and a warmup for the more advanced theories to follow. We begin with a brisk but reasonably complete account
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationFinite Fields. Sophie Huczynska. Semester 2, Academic Year
Finite Fields Sophie Huczynska Semester 2, Academic Year 2005-06 2 Chapter 1. Introduction Finite fields is a branch of mathematics which has come to the fore in the last 50 years due to its numerous applications,
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationa * (b * c) = (a * b) * c Now, we introduce a useful algebraic system called a group.
2S CHAPTER' ritroducto Cr The purpose of this chapter is to provide the reader with an elementary knowledge of algebra that will aid in the understanding of the material in the following chapters. The
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a
More informationKevin James. MTHSC 412 Section 3.1 Definition and Examples of Rings
MTHSC 412 Section 3.1 Definition and Examples of Rings A ring R is a nonempty set R together with two binary operations (usually written as addition and multiplication) that satisfy the following axioms.
More informationLatin squares. Clock arithmetic. Modular arithmetic. Binary operations 18/09/2013. Members only an introduction to groups
Members only an introduction to groups Sue de Pomerai MEI (FMSP Deputy rogramme Leader) 1 2 4 2 4 1 4 1 2 4 1 2 Latin squares A Latin square is an n n table filled with n different symbols in such a way
More informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationThe BCH Bound. Background. Parity Check Matrix for BCH Code. Minimum Distance of Cyclic Codes
S-723410 BCH and Reed-Solomon Codes 1 S-723410 BCH and Reed-Solomon Codes 3 Background The algebraic structure of linear codes and, in particular, cyclic linear codes, enables efficient encoding and decoding
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More informationAlgebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.
Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 9B ERROR CONTROL CODING Spring 005 Solutions for Homework 1. (Weights of codewords in a cyclic code) Let g(x) be the generator polynomial of a binary cyclic code of length n. (a) Show that if g(x) has
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More informationTheorem 5.3. Let E/F, E = F (u), be a simple field extension. Then u is algebraic if and only if E/F is finite. In this case, [E : F ] = deg f u.
5. Fields 5.1. Field extensions. Let F E be a subfield of the field E. We also describe this situation by saying that E is an extension field of F, and we write E/F to express this fact. If E/F is a field
More informationDEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY
HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both
More informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationIrreducible Polynomials. Finite Fields of Order p m (1) Primitive Polynomials. Finite Fields of Order p m (2)
S-72.3410 Finite Fields (2) 1 S-72.3410 Finite Fields (2) 3 Irreducible Polynomials Finite Fields of Order p m (1) The following results were discussed in the previous lecture: The order of a finite field
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More information2 so Q[ 2] is closed under both additive and multiplicative inverses. a 2 2b 2 + b
. FINITE-DIMENSIONAL VECTOR SPACES.. Fields By now you ll have acquired a fair knowledge of matrices. These are a concrete embodiment of something rather more abstract. Sometimes it is easier to use matrices,
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More information1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism
1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials
More information76 CHAPTER 7. INTRODUCTION TO FINITE FIELDS For further reading on this beautiful subject, see [E. R. Berlekamp, Algebraic Coding Theory, Aegean Press
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationChapter 3. Introducing Groups
Chapter 3 Introducing Groups We need a super-mathematics in which the operations are as unknown as the quantities they operate on, and a super-mathematician who does not know what he is doing when he performs
More informationCyclic codes. I give an example of a shift register with four storage elements and two binary adders.
Good afternoon, gentleman! Today I give you a lecture about cyclic codes. This lecture consists of three parts: I Origin and definition of cyclic codes ;? how to find cyclic codes: The Generator Polynomial
More informationMATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions
MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,
More informationPart IV. Rings and Fields
IV.18 Rings and Fields 1 Part IV. Rings and Fields Section IV.18. Rings and Fields Note. Roughly put, modern algebra deals with three types of structures: groups, rings, and fields. In this section we
More informationQuasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012
Quasi-cyclic codes Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico
More informationECEN 604: Channel Coding for Communications
ECEN 604: Channel Coding for Communications Lecture: Introduction to Cyclic Codes Henry D. Pfister Department of Electrical and Computer Engineering Texas A&M University ECEN 604: Channel Coding for Communications
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationMath Introduction to Modern Algebra
Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains
More informationDefinition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson
Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.
More information1 First Theme: Sums of Squares
I will try to organize the work of this semester around several classical questions. The first is, When is a prime p the sum of two squares? The question was raised by Fermat who gave the correct answer
More information