Self-Dual Cyclic Codes
|
|
- Mabel Todd
- 5 years ago
- Views:
Transcription
1 Self-Dual Cyclic Codes Bas Heijne November 29, 2007
2 Definitions Definition Let F be the finite field with two elements and n a positive integer. An [n, k] (block)-code C is a k dimensional linear subspace of F n.
3 Distance Definition For an element x F n one can define the Hamming weight, wt(x) as the number of non-zero coordinates of x. Example: wt(1, 0, 1, 1, 0) = 3. Definition Given a code C its minimal distance is: d = d(c) = min wt(x y) x,y C;x y Example: C = {(0, 0, 0), (1, 1, 0), (0, 1, 1), (1, 0, 1)}. d(c) = 2.
4 Weight enumerator polynomial Definition An [n, k, d]-code is an [n, k] code with distance d. Definition The weight enumerator,w C is given by: W C (X, Y ) := c C X wt(c) Y n wt(c).
5 Cyclic Codes Definition A cyclic code is an [n, k]-code C with the property that if (c 0,..., c n 1 ) C then we also have (c n 1, c 0,..., c n 2 ) C. Note: We allow n to be divisible by 2.
6 Ideals Proposition Under the identification F n = F[X ]/(X n 1) cyclic codes in F n correspond to ideals in the ring F[X ]/(X n 1). Note: F[X ]/(X n 1) is a principal ideal ring. Every ideal is of the form f F[X ]/(X n 1), where f (X ) X n 1 is a monic polynomial. Such f is determined by its roots (with multiplicity) which have order an odd number dividing n.
7 BCH-bound Theorem Let C be a cyclic [n, k, d]-code defined over F 2, with generating polynomial f, with n 2 mod 4. Fix ζ a primitive n/2-th root of unity. Assume that we have b and δ such that ζ b, ζ b+1,..., ζ b+δ 2 are all zeroes of f with multiplicity 2. Then d δ.
8 BCH-bound proof Codeword c(x ) = i S X i, with wt(c) = #S < δ. c C so c g f mod X n 1, hence c(ζ b+j ) = 0 and c (ζ b+j ) = 0. Considering Xc and Xc + c one obtains a nontrivial vector in the kernel of: ζ s 1b ζ s 2b... ζ sw b ζ s 1(b+1) ζ s 2(b+1) sw... ζ (b+1) M =...., ζ s 1(b+w 1) ζ s 2(b+w 1) sw... ζ (b+w 1) with s i in S. This contradicts: det M 0.
9 An example Take n = 18. f (X ) = 1 + X + X 6 + X 7 + X 12 + X 13. Take ζ a primitive 9 th root of unity. (This element lies in F 64.) ζ 1, ζ 2, ζ 4, ζ 5, ζ 7 and ζ 8 occur with multiplicity 2. BCH d 3 (in fact d = 6).
10 The dual of a code Definition Let C be an [n, k]-code then the dual code, C of C is the [n, n k] code given by C = {x F n : c C x c = 0}. Definition A code satisfying C = C is called self-dual.
11 Weight enumerator of a dual code Theorem (MacWilliams) Let C be a binary block code and let W C (X, Y ) be the weight enumerator then W C (X, Y ) = 1 #C W C(Y X, Y + X ). So if C is ( self-dual ) W C is invariant ( under) the group generated by α = and β =, which is D
12 Weight enumerator of a self-dual code Using the invarant theory of D 8 we find: Theorem Let C be a self-dual code. Then there are integers a 0,... a n 8 Z such that: n 8 W C (X, Y ) = a i (X 2 + Y 2 ) n/2 4i (X 2 Y 2 (X 2 Y 2 ) 2 ) i. i=0
13 The reciprocal of a polynomial. Definition Let f F[X ] be a polynomial of degree k over any field then the reciprocal polynomial, f, is defined as f (X ) = X k f ( 1 X ). (a 0 + a 1 X a k X k ) = a k + a k 1 X a 0 X k. f g = (fg). If f (0) = 1 then deg(f ) = deg(f ).
14 The dual of a cyclic code Theorem Let C be a cyclic code with generating polynomial f (X ) X n 1, then C is cyclic with generating polynomial g, where X n 1 = f (X )g(x ). Proof: Exercise.
15 Finding Self-Dual Cyclic codes. Conclusion: C is a cyclic self-dual code if and only if its generating polynomial satisfies: f f = 1 + X n. To find such an example: Split the zeroes of X n 1 into subsets stable under Frobenius. {α} { 1 α }.
16 Arbitrary distance Theorem Given a positive integer δ. There exist a non-trivial cyclic self-dual code with length n 16δ 2 and distance d δ Proof: Fix a Z minimal such that 2 a δ. Take k = 2 2a+1 1. Fix ζ of order k. Construct f, g and k odd such that X k 1 = ff g and f (ζ 1 ) = f (ζ 2 ) =... = f (ζ δ 1 ) = 0. Then the code generated by f 2 g of lenght 2k satisfies the conditions.
17 Arbitrary distance (proof) We have < ζ > = Z/kZ G = {1,..., 2 a 1}. S = i 0 2i G. Take f = s S (X ζs ) F 2 [X ].
18 Arbitrary distance (proof)(continued) Why does this f (X ) satisfy gcd(f, f ) = 1? The roots of f and f are ζ S respectively ζ S So we need S S = An element in Z/kZ can be written as: c 0 + c c 2a 2 2a An element in G can be written as: c 0 + c c a 1 2 a 1 Elements in S have a + 1 coeffs c i = 0. Elements in S have a coeffs c i = 0.
19 upper bounds Gleason(1970): A self-dual [n, k, d] code satisfies d n 8. Conway and Sloane(1990): Improvede this to d 2 n+6 10 for n > 72. There are further improvements e.g. Rains(2001).
20 The shadow Theorem Every cyclic self-dual code C contains a word c with wt(c) 2 mod 4 i.e. There exists an exact sequence: 0 C (0) C wt mod 4 2Z/4Z = F 2 0 Definition For a binary cyclic self-dual code C we define the shadow S of by S = C (0) \ C. The shadow is a cyclic code, but not a linear one as it does not contain the zero vector.
21 The weight enumerator of the shadow Theorem Let C be a binary self-dual code of lenght n = 2k. Let S be its shadow then we have: W S (X, Y ) = 1 2 k W C( 1(Y X ), (Y + X )). Corollary With W C = n 8 i=0 a i(x 2 + Y 2 ) n/2 4i (X 2 Y 2 (X 2 Y 2 ) 2 ) i one has n 8 W S (X, Y ) = 2 k 6i a i (XY ) n/2 4i (Y 4 X 4 ) 2i. i=0
22 An upper bound Theorem (Conway and Sloane) Let C be a [n, k, d] self-dual code. Assume n > 72 then we have: d 2 n For cyclic self-dual codes the original proof can be simplified as follows.
23 An upper bound Proof Fix l and δ such that n = 10l + 2δ, with 3 δ 1. Assume that the distance d 2l + 2. Then n 2l 2 W C = X n + Y n + A i X i Y n i. i=2l+2
24 An upper bound Proof (continued) n 2l 2 X n +Y n + A i X i Y n i = i=2l+2 n 8 a i (X 2 +Y 2 ) n/2 4i (X 2 Y 2 (X 2 Y 2 ) 2 ) i. i=0 Put X = 1 and Y 2 = y the modulo y l+1 : n 8 1 a i (1 + y) n/2 4i (y(1 y) 2 ) i mod y l+1. i=0
25 An upper bound Proof (continued) Using the Bürmann-Lagrange formula this implies: a l = n 2l the coefficient of y l 1 in (1 y 2 ) l δ 1 (1 y) l+δ+1. Remember n = 10l + 2δ. This implies that a l < 0.
26 An upper bound Proof (continued) Write: W S (X, Y ) = n B i X i Y n i i=0 n 8 W S (X, Y ) = 2 k 6i a i (XY ) n/2 4i (Y 4 X 4 ) 2i. i=0 We already know that B i = 0 if i < d/2. If n > 144 we also get B d/2 = 0. Since we assumed that d 2l + 2 it follows that a l = 0 a contradiction.
: Error Correcting Codes. November 2017 Lecture 2
03683072: Error Correcting Codes. November 2017 Lecture 2 Polynomial Codes and Cyclic Codes Amnon Ta-Shma and Dean Doron 1 Polynomial Codes Fix a finite field F q. For the purpose of constructing polynomial
More informationOpen Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
More informationSolutions of Exam Coding Theory (2MMC30), 23 June (1.a) Consider the 4 4 matrices as words in F 16
Solutions of Exam Coding Theory (2MMC30), 23 June 2016 (1.a) Consider the 4 4 matrices as words in F 16 2, the binary vector space of dimension 16. C is the code of all binary 4 4 matrices such that the
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 informationConstruction X for quantum error-correcting codes
Simon Fraser University Burnaby, BC, Canada joint work with Vijaykumar Singh International Workshop on Coding and Cryptography WCC 2013 Bergen, Norway 15 April 2013 Overview Construction X is known from
More informationOn Extremal Codes With Automorphisms
On Extremal Codes With Automorphisms Anton Malevich Magdeburg, 20 April 2010 joint work with S. Bouyuklieva and W. Willems 1/ 33 1. Linear codes 2. Self-dual and extremal codes 3. Quadratic residue codes
More informationConstruction of a (64, 2 37, 12) Code via Galois Rings
Designs, Codes and Cryptography, 10, 157 165 (1997) c 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Construction of a (64, 2 37, 12) Code via Galois Rings A. R. CALDERBANK AT&T
More informationOutline. MSRI-UP 2009 Coding Theory Seminar, Week 2. The definition. Link to polynomials
Outline MSRI-UP 2009 Coding Theory Seminar, Week 2 John B. Little Department of Mathematics and Computer Science College of the Holy Cross Cyclic Codes Polynomial Algebra More on cyclic codes Finite fields
More informationRepeated-Root Self-Dual Negacyclic Codes over Finite Fields
Journal of Mathematical Research with Applications May, 2016, Vol. 36, No. 3, pp. 275 284 DOI:10.3770/j.issn:2095-2651.2016.03.004 Http://jmre.dlut.edu.cn Repeated-Root Self-Dual Negacyclic Codes over
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 informationA first step towards the skew duadic codes
A first step towards the skew duadic codes Delphine Boucher To cite this version: Delphine Boucher. A first step towards the skew duadic codes. 2017. HAL Id: hal-01560025 https://hal.archives-ouvertes.fr/hal-01560025v2
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 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 informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationELG 5372 Error Control Coding. Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes
ELG 5372 Error Control Coding Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes Quotient Ring Example + Quotient Ring Example Quotient Ring Recall the quotient ring R={,,, }, where
More informationCYCLIC SIEVING FOR CYCLIC CODES
CYCLIC SIEVING FOR CYCLIC CODES ALEX MASON, VICTOR REINER, SHRUTHI SRIDHAR Abstract. These are notes on a preliminary follow-up to a question of Jim Propp, about cyclic sieving of cyclic codes. We show
More informationAlgebra Review 2. 1 Fields. A field is an extension of the concept of a group.
Algebra Review 2 1 Fields A field is an extension of the concept of a group. Definition 1. A field (F, +,, 0 F, 1 F ) is a set F together with two binary operations (+, ) on F such that the following conditions
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 informationMath 121 Homework 3 Solutions
Math 121 Homework 3 Solutions Problem 13.4 #6. Let K 1 and K 2 be finite extensions of F in the field K, and assume that both are splitting fields over F. (a) Prove that their composite K 1 K 2 is a splitting
More informationClassification of Finite Fields
Classification of Finite Fields In these notes we use the properties of the polynomial x pd x to classify finite fields. The importance of this polynomial is explained by the following basic proposition.
More informationERROR CORRECTING CODES
ERROR CORRECTING CODES To send a message of 0 s and 1 s from my computer on Earth to Mr. Spock s computer on the planet Vulcan we use codes which include redundancy to correct errors. n q Definition. A
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationInformation Theory. Lecture 7
Information Theory Lecture 7 Finite fields continued: R3 and R7 the field GF(p m ),... Cyclic Codes Intro. to cyclic codes: R8.1 3 Mikael Skoglund, Information Theory 1/17 The Field GF(p m ) π(x) irreducible
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 information1 The Galois Group of a Quadratic
Algebra Prelim Notes The Galois Group of a Polynomial Jason B. Hill University of Colorado at Boulder Throughout this set of notes, K will be the desired base field (usually Q or a finite field) and F
More informationFinite fields: some applications Michel Waldschmidt 1
Ho Chi Minh University of Science HCMUS Update: 16/09/2013 Finite fields: some applications Michel Waldschmidt 1 Exercises We fix an algebraic closure F p of the prime field F p of characteristic p. When
More informationWe saw in the last chapter that the linear Hamming codes are nontrivial perfect codes.
Chapter 5 Golay Codes Lecture 16, March 10, 2011 We saw in the last chapter that the linear Hamming codes are nontrivial perfect codes. Question. Are there any other nontrivial perfect codes? Answer. Yes,
More informationSkew Cyclic Codes Of Arbitrary Length
Skew Cyclic Codes Of Arbitrary Length Irfan Siap Department of Mathematics, Adıyaman University, Adıyaman, TURKEY, isiap@adiyaman.edu.tr Taher Abualrub Department of Mathematics and Statistics, American
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 informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
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 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 informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationSymmetries of Weight Enumerators
Martino Borello (Paris 8-LAGA) Trento, 16.11.2016 1 / 23 Symmetries of Weight Enumerators Martino Borello Université Paris 8 - LAGA Trento, 16.11.2016 Martino Borello (Paris 8-LAGA) Trento, 16.11.2016
More informationbut no smaller power is equal to one. polynomial is defined to be
13. Radical and Cyclic Extensions The main purpose of this section is to look at the Galois groups of x n a. The first case to consider is a = 1. Definition 13.1. Let K be a field. An element ω K is said
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationOpen problems on cyclic codes
Open problems on cyclic codes Pascale Charpin Contents 1 Introduction 3 2 Different kinds of cyclic codes. 4 2.1 Notation.............................. 5 2.2 Definitions............................. 6
More informationRON M. ROTH * GADIEL SEROUSSI **
ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS RON M. ROTH * AND GADIEL SEROUSSI ** ABSTRACT It is shown that every q-ary primitive BCH code of designed distance δ and sufficiently
More informationThe MacWilliams Identities
The MacWilliams Identities Jay A. Wood Western Michigan University Colloquium March 1, 2012 The Coding Problem How to ensure the integrity of a message transmitted over a noisy channel? Cleverly add redundancy.
More informationGalois Theory TCU Graduate Student Seminar George Gilbert October 2015
Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationEE512: Error Control Coding
EE51: Error Control Coding Solution for Assignment on BCH and RS Codes March, 007 1. To determine the dimension and generator polynomial of all narrow sense binary BCH codes of length n = 31, we have to
More informationNonlinear Cyclic Codes over Z 4 whose Nechaev-Gray Images are Binary Linear Cyclic Codes
International Mathematical Forum, 1, 2006, no. 17, 809-821 Nonlinear Cyclic Codes over Z 4 whose Nechaev-Gray Images are Binary Linear Cyclic Codes Gerardo Vega Dirección General de Servicios de Cómputo
More informationCyclic codes: overview
Cyclic codes: overview EE 387, Notes 14, Handout #22 A linear block code is cyclic if the cyclic shift of a codeword is a codeword. Cyclic codes have many advantages. Elegant algebraic descriptions: c(x)
More informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + x f(x) = q(x)h(x) + r(x),
Coding Theory Massoud Malek Linear Cyclic Codes Polynomial and Words A polynomial of degree n over IK is a polynomial p(x) = a 0 + a 1 + + a n 1 x n 1 + a n x n, where the coefficients a 1, a 2,, a n are
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 informationSolutions of exercise sheet 11
D-MATH Algebra I HS 14 Prof Emmanuel Kowalski Solutions of exercise sheet 11 The content of the marked exercises (*) should be known for the exam 1 For the following values of α C, find the minimal polynomial
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationarxiv: v4 [cs.it] 14 May 2013
arxiv:1006.1694v4 [cs.it] 14 May 2013 PURE ASYMMETRIC QUANTUM MDS CODES FROM CSS CONSTRUCTION: A COMPLETE CHARACTERIZATION MARTIANUS FREDERIC EZERMAN Centre for Quantum Technologies, National University
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More informationPolynomials with nontrivial relations between their roots
ACTA ARITHMETICA LXXXII.3 (1997) Polynomials with nontrivial relations between their roots by John D. Dixon (Ottawa, Ont.) 1. Introduction. Consider an irreducible polynomial f(x) over a field K. We are
More information: Coding Theory. Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, upattane
2301532 : Coding Theory Notes by Assoc. Prof. Dr. Patanee Udomkavanich October 30, 2006 http://pioneer.chula.ac.th/ upattane Chapter 1 Error detection, correction and decoding 1.1 Basic definitions and
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationWeights in Codes and Genus 2 Curves
Weights in Codes and Genus 2 Curves arxiv:math/0306060v1 [math.nt] 3 Jun 2003 Gary McGuire José Felipe Voloch Department of Mathematics Department of Mathematics NUI Maynooth University of Texas Co. Kildare
More informationThe Golay codes. Mario de Boer and Ruud Pellikaan
The Golay codes Mario de Boer and Ruud Pellikaan Appeared in Some tapas of computer algebra (A.M. Cohen, H. Cuypers and H. Sterk eds.), Project 7, The Golay codes, pp. 338-347, Springer, Berlin 1999, after
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
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 informationMTHSC 3190 Section 2.9 Sets a first look
MTHSC 3190 Section 2.9 Sets a first look Definition A set is a repetition free unordered collection of objects called elements. Definition A set is a repetition free unordered collection of objects called
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationHomework 4 Solutions
Homework 4 Solutions November 11, 2016 You were asked to do problems 3,4,7,9,10 in Chapter 7 of Lang. Problem 3. Let A be an integral domain, integrally closed in its field of fractions K. Let L be a finite
More informationBinary codes of t-designs and Hadamard matrices
Binary codes of t-designs and Hadamard matrices Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University November 8, 2013 JSPS-DST Asian Academic Seminar 2013 Discrete Mathematics
More informationCodes and Rings: Theory and Practice
Codes and Rings: Theory and Practice Patrick Solé CNRS/LAGA Paris, France, January 2017 Geometry of codes : the music of spheres R = a finite ring with identity. A linear code of length n over a ring R
More informationSelf-Dual Codes and Invariant Theory
Gabriele Nebe Eric M. Rains Neil J.A. Sloane Self-Dual Codes and Invariant Theory With 10 Figures and 34 Tables 4y Springer Preface List of Symbols List of Tables List of Figures v xiv xxv xxvii 1 The
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 informationPolynomial Rings. i=0. i=0. n+m. i=0. k=0
Polynomial Rings 1. Definitions and Basic Properties For convenience, the ring will always be a commutative ring with identity. Basic Properties The polynomial ring R[x] in the indeterminate x with coefficients
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 informationAlgebraic function fields
Algebraic function fields 1 Places Definition An algebraic function field F/K of one variable over K is an extension field F K such that F is a finite algebraic extension of K(x) for some element x F which
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
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 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 informationOhio State University Department of Mathematics Algebra Qualifier Exam Solutions. Timothy All Michael Belfanti
Ohio State University Department of Mathematics Algebra Qualifier Exam Solutions Timothy All Michael Belfanti July 22, 2013 Contents Spring 2012 1 1. Let G be a finite group and H a non-normal subgroup
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
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 informationSection X.55. Cyclotomic Extensions
X.55 Cyclotomic Extensions 1 Section X.55. Cyclotomic Extensions Note. In this section we return to a consideration of roots of unity and consider again the cyclic group of roots of unity as encountered
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 101A: ALGEBRA I, PART D: GALOIS THEORY 11
MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of
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 informationGood Integers and Applications in Coding Theory. Silpakorn University
Good Integers and in Coding Theory Somphong Jitman Silpakorn University March 1, 2017 @MUIC God made the integers, all else is the work of man. L. Kronecker 1 Good Integers 2 Good Integers P. Moree (1997)
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.
More informationNew algebraic decoding method for the (41, 21,9) quadratic residue code
New algebraic decoding method for the (41, 21,9) quadratic residue code Mohammed M. Al-Ashker a, Ramez Al.Shorbassi b a Department of Mathematics Islamic University of Gaza, Palestine b Ministry of education,
More information1 The Algebraic Normal Form
1 The Algebraic Normal Form Boolean maps can be expressed by polynomials this is the algebraic normal form (ANF). The degree as a polynomial is a first obvious measure of nonlinearity linear (or affine)
More informationRings in Coding Theory
Rings in Coding Theory Steven T. Dougherty July 3, 2013 Cyclic Codes Cyclic Codes were first studied by Prange in 1957. Prange, E. Cyclic error-correcting codes in two symbols. Technical Note TN-57-103,
More informationORAL QUALIFYING EXAM QUESTIONS. 1. Algebra
ORAL QUALIFYING EXAM QUESTIONS JOHN VOIGHT Below are some questions that I have asked on oral qualifying exams (starting in fall 2015). 1.1. Core questions. 1. Algebra (1) Let R be a noetherian (commutative)
More informationClass Field Theory. Steven Charlton. 29th February 2012
Class Theory 29th February 2012 Introduction Motivating examples Definition of a binary quadratic form Fermat and the sum of two squares The Hilbert class field form x 2 + 23y 2 Motivating Examples p =
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationON QUANTUM CODES FROM CYCLIC CODES OVER A CLASS OF NONCHAIN RINGS
Bull Korean Math Soc 53 (2016), No 6, pp 1617 1628 http://dxdoiorg/104134/bkmsb150544 pissn: 1015-8634 / eissn: 2234-3016 ON QUANTUM CODES FROM CYCLIC CODES OVER A CLASS OF NONCHAIN RINGS Mustafa Sari
More informationSymmetries of weight enumerators
Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 0 / 13 Symmetries of weight enumerators Martino Borello Université Paris 8 - LAGA Fq13 Martino Borello (Paris 8-LAGA) Gaeta, 06.06.2017 1 / 13 Introduction
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationIUPUI Qualifying Exam Abstract Algebra
IUPUI Qualifying Exam Abstract Algebra January 2017 Daniel Ramras (1) a) Prove that if G is a group of order 2 2 5 2 11, then G contains either a normal subgroup of order 11, or a normal subgroup of order
More informationFinite Fields. [Parts from Chapter 16. Also applications of FTGT]
Finite Fields [Parts from Chapter 16. Also applications of FTGT] Lemma [Ch 16, 4.6] Assume F is a finite field. Then the multiplicative group F := F \ {0} is cyclic. Proof Recall from basic group theory
More informationConstruction of quasi-cyclic self-dual codes
Construction of quasi-cyclic self-dual codes Sunghyu Han, Jon-Lark Kim, Heisook Lee, and Yoonjin Lee December 17, 2011 Abstract There is a one-to-one correspondence between l-quasi-cyclic codes over a
More informationArrangements, matroids and codes
Arrangements, matroids and codes first lecture Ruud Pellikaan joint work with Relinde Jurrius ACAGM summer school Leuven Belgium, 18 July 2011 References 2/43 1. Codes, arrangements and matroids by Relinde
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationPolynomials over UFD s
Polynomials over UFD s Let R be a UFD and let K be the field of fractions of R. Our goal is to compare arithmetic in the rings R[x] and K[x]. We introduce the following notion. Definition 1. A non-constant
More informationDiscrete Math, Second Problem Set (June 24)
Discrete Math, Second Problem Set (June 24) REU 2003 Instructor: Laszlo Babai Scribe: D Jeremy Copeland 1 Number Theory Remark 11 For an arithmetic progression, a 0, a 1 = a 0 +d, a 2 = a 0 +2d, to have
More informationAlgebraic number theory Revision exercises
Algebraic number theory Revision exercises Nicolas Mascot (n.a.v.mascot@warwick.ac.uk) Aurel Page (a.r.page@warwick.ac.uk) TA: Pedro Lemos (lemos.pj@gmail.com) Version: March 2, 20 Exercise. What is the
More informationHomework #5 Solutions
Homework #5 Solutions p 83, #16. In order to find a chain a 1 a 2 a n of subgroups of Z 240 with n as large as possible, we start at the top with a n = 1 so that a n = Z 240. In general, given a i we will
More informationCyclic codes. Vahid Meghdadi Reference: Error Correction Coding by Todd K. Moon. February 2008
Cyclic codes Vahid Meghdadi Reference: Error Correction Coding by Todd K. Moon February 2008 1 Definitions Definition 1. A ring < R, +,. > is a set R with two binary operation + (addition) and. (multiplication)
More information