TC08 / 6. Hadamard codes SX
|
|
- Allen Porter
- 5 years ago
- Views:
Transcription
1 TC8 / 6. Hadamard codes SX Hadamard matrices Hadamard matrices. Paley s construction of Hadamard matrices Hadamard codes. Decoding Hadamard codes A Hadamard matrix of order is a matrix of type whose coefficients are or and such that. Note that this relation is equivalent to say that the rows of have norm and that any two distinct rows are orthogonal. Since is invertible and, we see that
2 2 and hence is also a Hadamard matrix. Thus is a Hadamard matrix if and only if its columns have norm and any two distinct columns are orthogonal. If is a Hadamard matrix of order, then det. In particular we see that the Hadamard matrices satisfy the equality in Hadamard s inequality: /, det which is valid for all real matrices of order. Remark. The expression / is the supremum of the value of det when runs over the real matrices such that. Moreover, the equality is reached if and only if is a Hadamard matrix.
3 3 If we change the signs of a row (column) of a Hadamard matrix, the result is clearly a Hadamard matrix. If we permute the rows (columns) of a Hadamard matrix, the result is another Hadamard matrix. Two Hadamard matrices are called equivalent (or isomorphic) if it is to go from one to the other by means of a sequence of such operations. Observe that by changing the sign of all the columns that begin with, and afterwards all the rows that begin with, we obtain an equivalent Hadamard matrix whose first row and first column only contain. Of such matrices we say that are normalized Hadamard matrices. Example. is the unique normalized Hadamard matrix of order 2. More generally, if we define, 2, recursively by the formula
4 4, then is a normalized Hadamard matrix of order 2. It is also easy to check that if and are Hadamard matrices of orders and, then the tensor product is a Hadamard matrix of order (the matrix, also called the Kronecker product of and, can be defined as the matrix obtained by substituting each component of by the matrix ). For example, if is a Hadamard matrix of order, then is a Hadamard matrix of order 2. Notice also that.
5 5 Proposition. If is a Hadamard matrix of order 3, then is divisible by 4. Remark. Any two Hadamard matrices of order 4 are equivalent.. The same happens for order 8, but later on we will see that this is no longer the case for order 2. The Paley construction of Hadamard matrices Suppose that the cardinal of,, is odd, so that with 2, prime. Let :
6 6 be the Legendre character of, namely if is a square if not a square (conventionally we define ). Note that If we enumerate the elements of (in some order),.,,,, the Paley matrix of,, is defined by the formula.
7 7 Proposition. if is the matrix with all its entries equal to, then has the following properties: ) 2) 3) 4) /.
8 8 THeorem. if mod4, then the matrix is a Hadamard matrix of order. It is called the Hadamard matrix of. In the case that is not divisible by 4, it is possible to construct a Hadamard matrix of order 2 2, as we will see in the exercises. We are going to use the following concept: a matrix of order is a conference matrix if its principal diagonal is zero, the other elements are and. It is immediate to check that the order of a conference matrix is necessarily even. The first ten that satisfy this condition are 7,, 9, 23, 27, 3, 37,43, 47, 59.
9 9 Remark. Let S be the Paley matrix of a finite field, odd, and let if is symmetric and if is skew symmetric. Then is a conference matrix of order (it is called the conference matrix of ). This matrix is symmetric if mod 4 and skew symmetric if 3 mod 4. Note that in the case 3 mod 4 the matrix is equivalent to the matrix of the previous theorem. Remark. a) If is an skew symmetric conference matrix of order, is a Hadamard matrix. b) If is a symmetric conference matrix of order, is a Hadamard matrix of order 2.
10 c) If is the conference matrix of a finite field, and is divisible by 4, (b) yields a Hadamard matrix of order 2 2. This matrix will be called the Hadamard matrix de. Remark. The Hadamard matrices,,, have order 4, 8, 6, 32. For 7,, 9, 23, 27, 3, the theorem yields Hadamard matrices,,,,,. Part (c) of the preceding remark, applied to the fields, and, provides us with matrices,,. Thus we have Hadamard matrices of orders 4, 8, 2, 6, 2, 24, 28 and 32. Proceeding in similar ways, and with others that are beyond the scope of these notes, we can construct Hadamard matrices for many orders. The first ordre for which no Hadamard matrix is known is n=668 (the previous value was 428, but it was solved by Behruz Tayfeh Rezaie in 24).
11 Is is conjectured that for any that is multiple of 4 there is a Hadamard matrix of order. This is usually called the Hadamard conjecture, but it is probably due to Raymond Paley (993). Remark. The matrices and are distinct, but they are equivalent (all the Hadamard matrices of order 8 are equivalent). It can also be seen that the matrices and are equivalent, even though it turns out that there are Hadamard matrices of order 2 that are not equivalent.
12 2 Code associated to a Hadamard matrix We associate a code of type, 2 to any Hadamard matrix of order as follows:, where () is the binary matrix obtained by the substitution in (). Notice that the words in can also be obtain as the complements of the words in. Since two rows of differ in exactly /2 positions, the minimum distance of is /2. Hence is a code of type, 2, /2. In general this code is not linear (a necessary condition for linearity is that be a power of 2). Note that is not equidistant, as it contains the words and.
13 3 Example. The code is equivalent to the parity completion of the Hamming code 7,4,3. In particular, it is a linear code
14 4 Example. The code 32,64,6 is the code used in the period by the Mariner spacecraft to transmit images of Mars (this code also turns out to be linear, and actually equivalent to lineal 5). Decoding Hadamard codes Let be the Hadamard code associated to the Hadamard matrix. Let be the order of and /2 /2 2/4 4/4 its error correcting capacity. Given a vector of length, let, be the result of performing the substitution in. For example, from the definition of it turns out that if (or ), then (or ) is a row of.
15 5 Lemma. Let be a binary vector of length, the result of negating an entry of, and any row of. Then 2. Proposition. Let, where is a Hadamard matrix of order. Suppose that is the sent vector, that is the error vector and that is the received vector. Let and suppose that. Then there is a unique row of such that /2 and /2 for all other rows of. Moreover, or according to whether or.
16 6 Decoding algorithm Input: (the received vector). ) Calculate. 2) Calculate for the successive rows of, and stop as soon as /2 or if there are no more rows. In this second case return Error. 3) Return the result of performing the substitution in the vector () if ( ). Exercise. The code is equivalent to the Hadamard code. Hint: If is a control matrix of Ham, then the matrix is a generating matrix of.
--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationHadamard Codes. A Hadamard matrix of order n is a matrix H n with elements 1 or 1 such that H n H t n = n I n. For example,
Coding Theory Massoud Malek Hadamard Codes A Hadamard matrix of order n is a matrix H n with elements 1 or 1 such that H n H t n = n I n. For example, [ ] 1 1 1 1 1 1 1 1 1 1 H 1 = [1], H 2 =, H 1 1 4
More informationNew constructions for Hadamard matrices
New constructions for Hadamard matrices Paul Leopardi Mathematical Sciences Institute, Australian National University. For presentation at University of Newcastle. 26 April 2012 Introduction Acknowledgements
More informationError Detection and Correction: Hamming Code; Reed-Muller Code
Error Detection and Correction: Hamming Code; Reed-Muller Code Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Hamming Code: Motivation
More informationHadamard and conference matrices
Hadamard and conference matrices Peter J. Cameron December 2011 with input from Dennis Lin, Will Orrick and Gordon Royle Hadamard s theorem Let H be an n n matrix, all of whose entries are at most 1 in
More informationReformulation of the Hadamard conjecture via Hurwitz-Radon word systems
Reformulation of the Hadamard conjecture via Hurwitz-Radon word systems Miklós Ujvári Abstract. The Hadamard conjecture (unsolved since 1867) states that there exists an orthogonal matrix with entries
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 informationSquare 2-designs/1. 1 Definition
Square 2-designs Square 2-designs are variously known as symmetric designs, symmetric BIBDs, and projective designs. The definition does not imply any symmetry of the design, and the term projective designs,
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin University of Queensland 5 November 2012 Outline 1 Hadamard matrices 2 Symmetric designs 3 Hadamard matrices and difference sets 4 Two-transitivity
More information9 THEORY OF CODES. 9.0 Introduction. 9.1 Noise
9 THEORY OF CODES Chapter 9 Theory of Codes After studying this chapter you should understand what is meant by noise, error detection and correction; be able to find and use the Hamming distance for a
More informationHadamard and conference matrices
Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert,
More informationSOME ANALYTICAL ASPECTS OF HADAMARD MATRICES
SOME AALYTICAL ASPECTS OF HADAMARD MATRICES IO ECHITA Contents. The Hadamard conjecture. Historical remarks 2. The determinant of sign matrices 2 3. The l norm of orthogonal matrices 3 4. Almost Hadamard
More informationAlgebraic aspects of Hadamard matrices
Algebraic aspects of Hadamard matrices Padraig Ó Catháin University of Queensland 22 February 2013 Overview Difference set Relative difference set Symmetric Design Hadamard matrix Overview 1 Hadamard matrices
More informationHadamard and conference matrices
Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert,
More informationAperiodic correlation and the merit factor
Aperiodic correlation and the merit factor Aina Johansen 02.11.2009 Correlation The periodic correlation between two binary sequences {x t } and {y t } of length n at shift τ is defined as n 1 θ x,y (τ)
More information18.S34 linear algebra problems (2007)
18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction
More informationchannel of communication noise Each codeword has length 2, and all digits are either 0 or 1. Such codes are called Binary Codes.
5 Binary Codes You have already seen how check digits for bar codes (in Unit 3) and ISBN numbers (Unit 4) are used to detect errors. Here you will look at codes relevant for data transmission, for example,
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 informationHomework 11/Solutions. (Section 6.8 Exercise 3). Which pairs of the following vector spaces are isomorphic?
MTH 9-4 Linear Algebra I F Section Exercises 6.8,4,5 7.,b 7.,, Homework /Solutions (Section 6.8 Exercise ). Which pairs of the following vector spaces are isomorphic? R 7, R, M(, ), M(, 4), M(4, ), P 6,
More informationOn Hadamard s Maximal Determinant Problem
Judy-anne Osborn MSI, ANU April 2009 m 0 1 1 0 0 0 0.... 1....................... 1......... 0 0......... 0......... 1......... 0......... 1......... m 1 max det =? A Naive Computer Search Order max det
More informationTrades in complex Hadamard matrices
Trades in complex Hadamard matrices Padraig Ó Catháin Ian M. Wanless School of Mathematical Sciences, Monash University, VIC 3800, Australia. February 9, 2015 Abstract A trade in a complex Hadamard matrix
More informationOn the Least Number of Cell Orbits of a Hadamard Matrix of Order n
Irish Math. Soc. Bulletin 56 (2005), 95 102 95 On the Least Number of Cell Orbits of a Hadamard Matrix of Order n WARWICK DE LAUNEY AND RICHARD STAFFORD Abstract. The automorphism group of any Hadamard
More informationHadamard matrices, difference sets and doubly transitive permutation groups
Hadamard matrices, difference sets and doubly transitive permutation groups Padraig Ó Catháin University of Queensland 13 November 2012 Outline 1 Hadamard matrices 2 Symmetric designs 3 Hadamard matrices
More information1. How many errors may be detected (not necessarily corrected) if a code has a Hamming Distance of 6?
Answers to Practice Problems Practice Problems - Hamming distance 1. How many errors may be detected (not necessarily corrected) if a code has a Hamming Distance of 6? 2n = 6; n=3 2. How many errors may
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 informationHadamard matrices and strongly regular graphs with the 3-e.c. adjacency property
Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property Anthony Bonato Department of Mathematics, Wilfrid Laurier University, Waterloo, Ontario, Canada, N2L 3C5 abonato@wlu.ca
More informationSome remarks on Hadamard matrices
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2010 Some remarks on Hadamard matrices Jennifer Seberry University of
More informationMath 512 Syllabus Spring 2017, LIU Post
Week Class Date Material Math 512 Syllabus Spring 2017, LIU Post 1 1/23 ISBN, error-detecting codes HW: Exercises 1.1, 1.3, 1.5, 1.8, 1.14, 1.15 If x, y satisfy ISBN-10 check, then so does x + y. 2 1/30
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationCombinatorics in Space. The Mariner 9 Telemetry System
Combinatorics in Space The Mariner 9 Telemetry System Mariner 9 Mission Launched: May 30, 1971 Arrived: Nov. 14, 1971 Turned Off: Oct. 27, 1972 Mission Objectives: (Mariner 8): Map 70% of Martian surface.
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
More informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 1 Error-correcting codes In this section of the notes, we have a quick look at coding theory. After a motivating introduction, we discuss the weight enumerator of a code,
More informationAnswers and Solutions to (Even Numbered) Suggested Exercises in Sections of Grimaldi s Discrete and Combinatorial Mathematics
Answers and Solutions to (Even Numbered) Suggested Exercises in Sections 6.5-6.9 of Grimaldi s Discrete and Combinatorial Mathematics Section 6.5 6.5.2. a. r = = + = c + e. So the error pattern is e =.
More informationModular numbers and Error Correcting Codes. Introduction. Modular Arithmetic.
Modular numbers and Error Correcting Codes Introduction Modular Arithmetic Finite fields n-space over a finite field Error correcting codes Exercises Introduction. Data transmission is not normally perfect;
More informationLinear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.
Homework # due Thursday, Oct. 0. Show that the diagonals of a square are orthogonal to one another. Hint: Place the vertices of the square along the axes and then introduce coordinates. 2. Find the equation
More informationSome results on the existence of t-all-or-nothing transforms over arbitrary alphabets
Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets Navid Nasr Esfahani, Ian Goldberg and Douglas R. Stinson David R. Cheriton School of Computer Science University of
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationApprentice Program: Linear Algebra
Apprentice Program: Linear Algebra Instructor: Miklós Abért Notes taken by Matt Holden and Kate Ponto June 26,2006 1 Matrices An n k matrix A over a ring R is a collection of nk elements of R, arranged
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationarxiv: v4 [math.co] 12 Feb 2017
arxiv:1511.03511v4 [math.co] 12 Feb 2017 On the signed graphs with two distinct eigenvalues F. Ramezani 1 Department of Mathematics, K.N.Toosi University of Technology, Tehran, Iran P.O. Box 16315-1618
More informationLecture 17: Perfect Codes and Gilbert-Varshamov Bound
Lecture 17: Perfect Codes and Gilbert-Varshamov Bound Maximality of Hamming code Lemma Let C be a code with distance 3, then: C 2n n + 1 Codes that meet this bound: Perfect codes Hamming code is a perfect
More informationHadamard matrices of order 32
Hadamard matrices of order 32 H. Kharaghani a,1 B. Tayfeh-Rezaie b a Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, T1K3M4, Canada b School of Mathematics,
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 informationA Field Extension as a Vector Space
Chapter 8 A Field Extension as a Vector Space In this chapter, we take a closer look at a finite extension from the point of view that is a vector space over. It is clear, for instance, that any is a linear
More informationSmall Orders of Hadamard Matrices and Base Sequences
International Mathematical Forum, Vol. 6, 2011, no. 62, 3061-3067 Small Orders of Hadamard Matrices and Base Sequences Dragomir Ž. D oković Department of Pure Mathematics and Institute for Quantum Computing
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 informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationFRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES
FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most
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 informationExtended Binary Linear Codes from Legendre Sequences
Extended Binary Linear Codes from Legendre Sequences T. Aaron Gulliver and Matthew G. Parker Abstract A construction based on Legendre sequences is presented for a doubly-extended binary linear code of
More informationexercise in the previous class (1)
exercise in the previous class () Consider an odd parity check code C whose codewords are (x,, x k, p) with p = x + +x k +. Is C a linear code? No. x =, x 2 =x =...=x k = p =, and... is a codeword x 2
More informationMatrix Operations: Determinant
Matrix Operations: Determinant Determinants Determinants are only applicable for square matrices. Determinant of the square matrix A is denoted as: det(a) or A Recall that the absolute value of the determinant
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationNote that r = 0 gives the simple principle of induction. Also it can be shown that the principle of strong induction follows from simple induction.
Proof by mathematical induction using a strong hypothesis Occasionally a proof by mathematical induction is made easier by using a strong hypothesis: To show P(n) [a statement form that depends on variable
More informationRings, Paths, and Paley Graphs
Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman September 12, 2012 5.1 About these notes These notes are not necessarily an accurate representation of what happened in
More informationPROBLEMS ON LINEAR ALGEBRA
1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.
More informationSelf-complementary strongly regular graphs revisited
Self-complementary strongly regular graphs revisited Ferenc Szöllősi (joint work in part with Patric Östergård) szoferi@gmail.com Department of Communications and Networking, Aalto University Talk at CoCoA15
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 informationLIFTED CODES OVER FINITE CHAIN RINGS
Math. J. Okayama Univ. 53 (2011), 39 53 LIFTED CODES OVER FINITE CHAIN RINGS Steven T. Dougherty, Hongwei Liu and Young Ho Park Abstract. In this paper, we study lifted codes over finite chain rings. We
More informationORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES
ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES ANDRIES E. BROUWER, ARJEH M. COHEN, MAN V.M. NGUYEN Abstract. All mixed (or asymmetric) orthogonal arrays of strength 3 with run size at most 64 are
More informationON THE CONSTRUCTION OF HADAMARD MATRICES. P.K. Manjhi 1, Arjun Kumar 2. Vinoba Bhave University Hazaribag, INDIA
International Journal of Pure and Applied Mathematics Volume 120 No. 1 2018, 51-58 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v120i1.4
More informationReed-Muller Codes. m r inductive definition. Later, we shall explain how to construct Reed-Muller codes using the Kronecker product.
Coding Theory Massoud Malek Reed-Muller Codes An iportant class of linear block codes rich in algebraic and geoetric structure is the class of Reed-Muller codes, which includes the Extended Haing code.
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 informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More informationFRAMES, GRAPHS AND ERASURES
FRAMES, GRAPHS AND ERASURES BERNHARD G. BODMANN AND VERN I. PAULSEN Abstract. Two-uniform frames and their use for the coding of vectors are the main subject of this paper. These frames are known to be
More informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationAn Overview of Complex Hadamard Cubes
Rose- Hulman Undergraduate Mathematics Journal An Overview of Complex Hadamard Cubes Ben Lantz a Michael Zowada b Volume 3, No. 2, Fall 202 Sponsored by Rose-Hulman Institute of Technology Department of
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 informationMATH3302. Coding and Cryptography. Coding Theory
MATH3302 Coding and Cryptography Coding Theory 2010 Contents 1 Introduction to coding theory 2 1.1 Introduction.......................................... 2 1.2 Basic definitions and assumptions..............................
More informationLinear Codes and Syndrome Decoding
Linear Codes and Syndrome Decoding These notes are intended to be used as supplementary reading to Sections 6.7 9 of Grimaldi s Discrete and Combinatorial Mathematics. The proofs of the theorems are left
More informationMath 896 Coding Theory
Math 896 Coding Theory Problem Set Problems from June 8, 25 # 35 Suppose C 1 and C 2 are permutation equivalent codes where C 1 P C 2 for some permutation matrix P. Prove that: (a) C 1 P C 2, and (b) if
More informationCirculant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv: v1 [math.co] 26 Nov 2017
Circulant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv:1711.09373v1 [math.co] 26 Nov 2017 J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona October
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
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 informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k- dimensional affine space, F k 3, over F 3. A line of
More informationCategories and Quantum Informatics: Hilbert spaces
Categories and Quantum Informatics: Hilbert spaces Chris Heunen Spring 2018 We introduce our main example category Hilb by recalling in some detail the mathematical formalism that underlies quantum theory:
More informationA Short Overview of Orthogonal Arrays
A Short Overview of Orthogonal Arrays John Stufken Department of Statistics University of Georgia Isaac Newton Institute September 5, 2011 John Stufken (University of Georgia) Orthogonal Arrays September
More informationCombinatorics of p-ary Bent Functions
Combinatorics of p-ary Bent Functions MIDN 1/C Steven Walsh United States Naval Academy 25 April 2014 Objectives Introduction/Motivation Definitions Important Theorems Main Results: Connecting Bent Functions
More informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
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 informationTilburg University. Binary codes of strongly regular graphs Haemers, Willem; Peeters, Rene; van Rijckevorsel, J.M.
Tilburg University Binary codes of strongly regular graphs Haemers, Willem; Peeters, Rene; van Rijckevorsel, J.M. Published in: Designs Codes and Cryptography Publication date: 1999 Link to publication
More informationON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE
ON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE AMANDA FURNESS Abstract. We examine relative class numbers, associated to class numbers of quadratic fields Q( m) for m > 0 and square-free. The relative
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
More informationLinear Cyclic Codes. Polynomial Word 1 + x + x x 4 + x 5 + x x + 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 x + + a n 1 x n 1 + a n x n, where the coefficients a 0, a 1, a 2,,
More informationLecture 12 (Tue, Mar 5) Gaussian elimination and LU factorization (II)
Math 59 Lecture 2 (Tue Mar 5) Gaussian elimination and LU factorization (II) 2 Gaussian elimination - LU factorization For a general n n matrix A the Gaussian elimination produces an LU factorization if
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationMathematics Department
Mathematics Department Matthew Pressland Room 7.355 V57 WT 27/8 Advanced Higher Mathematics for INFOTECH Exercise Sheet 2. Let C F 6 3 be the linear code defined by the generator matrix G = 2 2 (a) Find
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 informationOptimal XOR based (2,n)-Visual Cryptography Schemes
Optimal XOR based (2,n)-Visual Cryptography Schemes Feng Liu and ChuanKun Wu State Key Laboratory Of Information Security, Institute of Software Chinese Academy of Sciences, Beijing 0090, China Email:
More informationx n k m(x) ) Codewords can be characterized by (and errors detected by): c(x) mod g(x) = 0 c(x)h(x) = 0 mod (x n 1)
Cyclic codes: review EE 387, Notes 15, Handout #26 A cyclic code is a LBC such that every cyclic shift of a codeword is a codeword. A cyclic code has generator polynomial g(x) that is a divisor of every
More informationADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS
ADVANCED COMMUTATIVE ALGEBRA: PROBLEM SETS UZI VISHNE The 11 problem sets below were composed by Michael Schein, according to his course. Take into account that we are covering slightly different material.
More informationExercises for Unit VI (Infinite constructions in set theory)
Exercises for Unit VI (Infinite constructions in set theory) VI.1 : Indexed families and set theoretic operations (Halmos, 4, 8 9; Lipschutz, 5.3 5.4) Lipschutz : 5.3 5.6, 5.29 5.32, 9.14 1. Generalize
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationCHAPTER 7: Systems and Inequalities
(Exercises for Chapter 7: Systems and Inequalities) E.7.1 CHAPTER 7: Systems and Inequalities (A) means refer to Part A, (B) means refer to Part B, etc. (Calculator) means use a calculator. Otherwise,
More information13 More on free abelian groups
13 More on free abelian groups Recall. G is a free abelian group if G = i I Z for some set I. 13.1 Definition. Let G be an abelian group. A set B G is a basis of G if B generates G if for some x 1,...x
More informationA Series of Regular Hadamard Matrices
A Series of Regular Hadamard Matrices Dean Crnković Abstract Let p and p 1 be prime powers and p 3 (mod 4). Then there exists a symmetric design with parameters (4p,p p,p p). Thus there exists a regular
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 information22m:033 Notes: 3.1 Introduction to Determinants
22m:033 Notes: 3. Introduction to Determinants Dennis Roseman University of Iowa Iowa City, IA http://www.math.uiowa.edu/ roseman October 27, 2009 When does a 2 2 matrix have an inverse? ( ) a a If A =
More information