Institute of Statistics Mimeo Series No April 1965
|
|
- Britney Phoebe Townsend
- 5 years ago
- Views:
Transcription
1 _ - ON THE CONSTRUCTW OF DFFERENCE SETS AND THER USE N THE SEARCH FOR ORTHOGONAL ratn SQUARES AND ERROR CORRECTnm CODES by. M. Chakravarti University of North Carolina nstitute of Statistics Mimeo Series No. 427 April 1965 n this paper, a relationship is established between orthogonal mappings of a group and difference sets for construction of orthogonal arrays. A difference set D(lO,lO,5) has been constructed and is given as an illustration. Use of difference sets for construction of orthogona:l Latin squares and error correcting codes is discussed. This research was supported by the U. S. krrrry Research Office Grant No. DA-3l-J24-ARO-D-254. DEPARTMENT OF S'MTSTCS UNVERSTY OF NORTH CAROLmA Chapel Hill, N. C.
2 . _ On the Construction of Difference Sets and their Use in the Search for Orthogonal Latin Squares and Error Correcting Codes by. M. Chakravarti University of North Carolina 1. ntroduction. The concept of orthogonal mapping was developed in [2]. t has been shown there that the existence of s orthogonal mappings of a group of order 4t inqjlies the existence of s mutually orthogonal Latin squares of order 4t. t has been shown in [5], that a single-error correcting code of length 4 over an n-symbol alphabet with n 2 code words corresponds to a pair of orthogonal Latin squares of order n. n general, a set of t pair-wise orthogonal Latin squares of order n is equivalent to a code of n 2 words from an n symbol alphabet, with block length (t+2) and distance (t+l). Difference sets which provide orthogonal arrays were defined in [1]. Difference sets of order 2p for p = 3,5 and 7 were first constructed in [6]. The existence of difference sets of order 2p for p = 2t+1 an odd prime and t(t+l)/2 an odd integer, was also demonstrated in [6]. n [3], a general method of construction of difference sets of order 2p for p an odd prime (without the restriction as in [6]) has been given. n this paper, a relationship is established between orthpgonaj. mappings and difference sets for construction of orthogonal arrays. A difference set D(lO, 10, 5) has been constructed and is given as an illustration. Use of difference sets for construction of orthogonal Latin squares and associated error correcting codes is discussed.
3 2. Definitions Latin squares. A Latin square of order n is defined as an n x n square, the n 2 cells of lmich are occupied by n distinct symbols (which may be Latin or Greek letters or just integers) such that each symbol occurs once in each row and once in each column. is called the cell (i,.1). The cell in the ith row and the jth column Two Latin squares are said to be orthogonal if on superposition each sy:mbol of the first square occurs exactly once with each symbol of the second square Orthogonal arrays. Suppose A = «a ij» is a matrix, i = 1,2,..., m, j = 1,2,..., N and the elements of the matrix are symbols 0,1,2,..., s-l t Consider the s 1 x t matrices x' = (x l 'J!2', x t ) that can be formed by giving different values to xi's, Xi = 0,1,, s-l, i = 1,2,, t. Suppose associated with each t x 1 matrix as, there is a positive integer A (:;"J!2', x t ) which is invariant under permutations of (xl'j!2'..., x t ). t f for every submatrix having t rows of A, the s t x 1 matrices as occur as columns A(xl'~' balanced array of strength t s sy:mbols (or levels) and the specified..., x t ) times then the matrix A is called a partially in N assemblies, m constraints (or factors), r.. (:;"J!2'..., x t ) parameters. \fuen A(:;"~'..., x t ) = A for all x', the array is called an orthogonal arrb -A(N,m, s,t) of strength t, index r.., N assemblies and m constraints. A detailed account of methods of construction of orthogonal arrays is given in [4J._ An orthogonal array having s2 assemblies, t+2 constraints, strength 2 and index 1, corresponds to a set of t mutually orthogonal Latin squares of order s. 2.3 Difference sets. A difference set for constructing an orthogonal array is defined in 2 _,
4 . _ [1], as follows. Let E be a 1Ddule (additive group) consisting of s elements eo' e l,..., es-1. Suppose it is possible to find a scheme S of r rows and n columns, with elements belonging to E, sll s12 sln s2l s22 s.2n (2.1) S. srl sr2 s rn such that 8.lOOng the differences of the corresponding elements of any two rows, each element of E occurs exactly" times (n = "M). Then S is called a difference set generating an orthogonal arr8\y A(" a2, r, s, 2) Given S, the orthogonal array A is formed as follows: Write down the addition table of E. Then replace each element in the scheme S by the row in the addition table, corresponding to the element (use only the suffixes 0,1,2,..., s-l). 3. Generalized Hadamard Matrices. A square matrix H of order h all of whose elements are p th roots of unity, is called [3] a generalized Hadamard matrix (H(p,h) matrix), if HH ct = h, where H ct is the conjugate transpose of H. A generalized Hadamard matrix has been called an equimodular square matrix in [6]. When p is a prime, an H(p, h) matrix can exist only for values h = pt, Where t is a positive integer. A method of constructing H(p, 2 i pj) matrices for any prime p and any non-negative integers i < j has been given in [3]. Let H = «hij»i,j = 0,1,, pt-l, be a Ha.d.a.mard matrix of order pt, where p is an odd prime. Let ex be a primitive p th root of Sij unity and h ij = ex, i,j =0,1,, pt-l, where Sij GF(p).3
5 Then it is easily seen that the matrix S = «Sij» i,j = ~,1,, pt-l, be a Hada.ma.rd matrix of order pt, where p is an odd prime. Let ex be a Sij primitive. p th root of unity and h ij = ex, i,j = 0,1,..., pt-1, where s.. GF(p). Then it is easily seen that the matrix S = «s.j» ~. 1 i,j = 0,1,, pt-l, is a difference set as defined in Section 2.3. generate an orthogonal array Suppose p = 2q+1 is a prime and let n be the smallest quadratic Then it is easy to prove that _knq;_..t, y y- k = 0,1,, p-1 matrix (3.1) K = A(tp2,pt,p,2). non-residue of p. Let. ~ be the Van der Mende matrix defined by V = «v ij», v ij = ~j, i,j = 0,1,, p-l, where ex is a primitive p th root of unity. Then V is a symmetric H(p,p) matrix. Denote by U that permutation matrix for which W = VU has elements w ij = cfij, i,j = 0,1,..., p-1. Let the 2 nntrix Q = «%j» be such that %j = 0 for i f j and C1:i.i = ofl1, i = 0,1,2,..., p-1. Then C = QVQ and B = Q~n are H(p,p) matrices. Let D = «d. j» be the matrix defined by d.. = 0 for i f j, and J d ii = ~ for i = 0,1,, p-1 and T = «t ij» be the permutation ma~rix defined by t.+ 1. = 1, for i = 0,1,, p-1 and t.. = 0, otherwise. 1,1. 1J. Further, let Y = (1,1, 1) and Z = (0,0,, 0) be both of length p. D'kv =V'Jf and Dnkw = ~ t is also easily seen that the k th column of B can be written in the form ~Q'DyT. Let CP be the matrix whose k th column is given by Then it has been proved in [3], that the 4 t 1nll, _
6 . _ is an H(p, 2p) matrix. We give here an example of an S matrix which corresponds to an H(p, 2p) matrix for p = o (3.2) S = o This matrix is a difference set which can be used to generate an orthogonal array A(50,10,5,2), in the manner described in section 2.3. t has been soown in [6], that given an H(p,2p) matrix Where p is a prime, one can construct an orthogonal array A(2p2, 2p+1, p, 2). 4. Orthogonal mappings and construction of mutually orthogonal Latin squares. (4.1) Consider a finite group G of order n. Let a be a one-one mapping of G into itself, the image of the element x in G being denoted by a x Thus, the equation ax = c determines a unique x in G given c in G and conversely. Let denote the identity mapping which maps every x in G on x itself. such mappings define the permutation group ping a then corresponds a unique inverse 5 The set of all M, of order nl. To each map -1 a such that if ax = a, then a- 1 a = x. Let ax. denote the mapping for which the i.ma.ge of x is ox.x, where a and X; are in M t is clear that a X. is in M and that the associative law Jl( ax) = (JU)X holds.
7 Consider a n x n square. Make an (1,1) correspondence between the rows of the square and the elements of G. Similarly, between the columns of the square and the elements of G. ~e cell of the square corresponding to the row x and the column y is said to be the cell (x,y). We quote some results from [2] without proof. Theorem 4.1: f in each cell (x,y) of an n x n square we put the element (<Tx)y of G (er is a mapping belonging to M) we get a Latin square L(er). Let.er and X. be two mappings belonging to M. The> e are said to be orthogonal if the equation (4.2) has a unique solution x in G for every c in G. f the group operation is addition instead of multiplication, the equation (4.2) becomes (4.;) (erx) - (xx) = c Theorem 4.2: The necessary and sufficient condition for the Latin squares L(er) and L(x.) to be orthogonal is that the ma:p]';lings er and X. are orthogonal. Theorem 4.;: The necessary and sufficient condition for a finite mdule (additive Abelian group) to admit two orthogonal mappings is that the sum of the elements of the mdule vanish. Let G(~,~) denote a mdule whose elements are vectors (a1'a ), where 2 ~ is a residue class (mod ~) and a is a residue class (OOd ~), 2 the addition being defined by (4.4) (~,a2) + (b,b l 2 ) = (c l,c 2 ), where ~ + b l = c l (OOd n l ), a 2 + b 2 = c 2 (mod ~). The module has nl~ elements. From theorem 4,;, it follows that for the existence of a pair of orthogonal mappings for G(~,n2)' it is necessary and sufficient that n l and ~ have the same parity. 6 _ i
8 . _,. 5. Difference sets and orthogonal mappings Consider the difference set S of (;.2). We note every element of the group (0,1,2,;,4) occurs exactly twice in every row (column) except in the first row (c01~). And further amng the differences of pairs of corresponding elements in any 00 rows (columns) every element of the group (0,1,2,;,4) occurs exactly twice. This may be described as one to many mapping of the e1en:ents of the group of residue classes md 5 into itself and the additional property enjoyed by the mapping may be caj.1ed orthogonality in a wider sense. Consider a difference set of order ~~ with ~ symbols such that (i) every symbol occurs ~ t:imes in each row(each column) (i1) 8JOOng the differences of pairs of corresponding elements in any two rows (columns) every symbol occurs ~ times. Further, consider a roodule of ~ symbols. The problem is then of adjoining to each one of the symbols in the difference set, a symbol from this new roodu1e as a second co-ordinate, so that the whole scheme will define a difference set in n n elements (eac~ element is now 1 2 composed of two symbols taken from two different rodules). For instance, it vdll be of interest to construct a difference set of order 15 in five symbols (0,1,2,;,4) and then adjoin symbols from the module of the residue classes mod ;, so that the whole scheme becomes a difference set in symbols, (0,0),(0,1),(0,2),(1,0),(1,1),,(4,0),(4,1),(4,2). 6. Computer search for difference sets. The principles outlined in sections 4 and 5, provide a technique for computer search for difference sets Which will provide orthogonal Latin squares or orthogonal arrays. A similar technique was used in [2] in a search for orthogonal Latin squares of order 12. starting with a Hadamard 7
9 second coordinates to its columns (except the first Which consists of zeros only) so that the final array became a difference set with elements from the nodule ~dth elements (a,b) rthere a = 0,1, (mod 2) and b ~ 0,1,2,3,4,5 (mod 6). Using a comput er, an array consisting of five such columns only could be obtained. an illustration. This difference set (first given in [2]) is reproduced here as ~ ~ '\ (6.1) Error correcting codes associated with orthogonal Latin squares. ~le relationship betrreen a n-symbol block code of block length k and a set of (k-2) mutually orthogonal Latin squares of order n, described here is on the lines of [5]. Consider the set V(n,k) of all k-tuples from an n-symbol alphabet. Any subset of V(n,k) may be called a block code of blocl{ length k. The elements of the subset are the code words. The H.a.r.1ming distance between two code words is the number of coordinates in which they differ. A block code in ~Thich any pair of code words are at 8 _ matrix H(2,12), elements 0,1,2,3,4,5 (md 6) were to be adjoined as
10 . _ least a Hamming distance of r apart is called a distance r code. A distance r code can correct (r-l)/2 errors. t is easy to show that a set of t mutually orthogonal Latin squares of order n is equivalent to a set of n 2 (t+2)-tuples in n symbols such that the distance between any two (t+2)-tuples is at least (t+l). Hence this provides us a distance (t+l) code in n symbols of block length (t+2). Thus we have shown how difference sets might be used to construct orthogonal Latin squares, orthogonal arrays and error-correcting codes. 9
11 REFERENCES Bose, R. C. and Bush, K. A. (1952). Orthogonal arrays of strength two and three. Ann. Math. Statist.,~, Bose, R. C., Chakravarti,. M. and Knuth, D. E. (1960). On methods of constructing sets of mutually orthogonal Latin squares using a computer,. Technometrics,!, Butson, A. T. (1962). Generalized Hadamard matrices. Proc. Amer. Math. Soc., ~, Chakravarti,. M. (1963). Orthogonal and partially balanced arrays and their application in design of experiments. Metrika,!, Golomb, S. W. and Posner, E. C. (1964). Rook domains, Latin squares, affine planes and error-distributing codes. EEE Trans. on nform. Theory, T-10, Masuyama, M. (1957). On difference sets for constructing orthogonal arrays of index two and of strength two. Rep. Statist. Appl. Res., JUSE, 5, _ 1 1 1
On Construction of a Class of. Orthogonal Arrays
On Construction of a Class of Orthogonal Arrays arxiv:1210.6923v1 [cs.dm] 25 Oct 2012 by Ankit Pat under the esteemed guidance of Professor Somesh Kumar A Dissertation Submitted for the Partial Fulfillment
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 informationMutually Orthogonal Latin Squares: Covering and Packing Analogues
Squares: Covering 1 1 School of Computing, Informatics, and Decision Systems Engineering Arizona State University Mile High Conference, 15 August 2013 Latin Squares Definition A latin square of side n
More informationQUADRATIC RESIDUE CODES OVER Z 9
J. Korean Math. Soc. 46 (009), No. 1, pp. 13 30 QUADRATIC RESIDUE CODES OVER Z 9 Bijan Taeri Abstract. A subset of n tuples of elements of Z 9 is said to be a code over Z 9 if it is a Z 9 -module. In this
More informationCONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS
Statistica Sinica 24 (2014), 1685-1702 doi:http://dx.doi.org/10.5705/ss.2013.239 CONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS Mingyao Ai 1, Bochuan Jiang 1,2
More informationERROR-CORRECTING CODES AND LATIN SQUARES
ERROR-CORRECTING CODES AND LATIN SQUARES Ritu Ahuja Department of Mathematics, Khalsa College for Women, Civil Lines, Ludhiana 141001, Punjab, (India) ABSTRACT Data stored and transmitted in digital form
More informationOrthogonal Arrays & Codes
Orthogonal Arrays & Codes Orthogonal Arrays - Redux An orthogonal array of strength t, a t-(v,k,λ)-oa, is a λv t x k array of v symbols, such that in any t columns of the array every one of the possible
More informationAffine designs and linear orthogonal arrays
Affine designs and linear orthogonal arrays Vladimir D. Tonchev Department of Mathematical Sciences, Michigan Technological University, Houghton, Michigan 49931, USA, tonchev@mtu.edu Abstract It is proved
More informationA classification of sharp tridiagonal pairs. Tatsuro Ito, Kazumasa Nomura, Paul Terwilliger
Tatsuro Ito Kazumasa Nomura Paul Terwilliger Overview This talk concerns a linear algebraic object called a tridiagonal pair. We will describe its features such as the eigenvalues, dual eigenvalues, shape,
More informationNew quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices
New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices Carl Bracken, Gary McGuire Department of Mathematics, National University of Ireland, Maynooth, Co.
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 informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationChapter 1. Matrix Algebra
ST4233, Linear Models, Semester 1 2008-2009 Chapter 1. Matrix Algebra 1 Matrix and vector notation Definition 1.1 A matrix is a rectangular or square array of numbers of variables. We use uppercase boldface
More informationExtending MDS Codes. T. L. Alderson
Extending MDS Codes T. L. Alderson Abstract A q-ary (n,k)-mds code, linear or not, satisfies n q + k 1. A code meeting this bound is said to have maximum length. Using purely combinatorial methods we show
More informationLatin Squares and Orthogonal Arrays
School of Electrical Engineering and Computer Science University of Ottawa lucia@eecs.uottawa.ca Winter 2017 Latin squares Definition A Latin square of order n is an n n array, with symbols in {1,...,
More informationSTRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES
The Pennsylvania State University The Graduate School Department of Mathematics STRONG FORMS OF ORTHOGONALITY FOR SETS OF HYPERCUBES A Dissertation in Mathematics by John T. Ethier c 008 John T. Ethier
More informationWeek 15-16: Combinatorial Design
Week 15-16: Combinatorial Design May 8, 2017 A combinatorial design, or simply a design, is an arrangement of the objects of a set into subsets satisfying certain prescribed properties. The area of combinatorial
More informationFOR LARGE SERIAL NUMBERS. R. C. Bose. University of North Carolina. Institute of Statistics Mimeo Series No March 1965
.. e ERROR DETECTNG AND ERROR CORRECTNG ndexng SYSTEM> FOR LARGE SERAL NUMBERS R. C. Bose University of North Carolina nstitute of Statistics Mimeo Series No. 426 March 1965 Given a set of serial numbers,
More informationMATRICES AND ITS APPLICATIONS
MATRICES AND ITS Elementary transformations and elementary matrices Inverse using elementary transformations Rank of a matrix Normal form of a matrix Linear dependence and independence of vectors APPLICATIONS
More informationConstruction of some new families of nested orthogonal arrays
isid/ms/2017/01 April 7, 2017 http://www.isid.ac.in/ statmath/index.php?module=preprint Construction of some new families of nested orthogonal arrays Tian-fang Zhang, Guobin Wu and Aloke Dey Indian Statistical
More informationON THE EQUIVALENCE OF A SET OF MUTUALLY ORTHOGONAL LATIN SQUARES WITH OTHER COMBINATORIAL SYSTEMS (1) By A-. Hedayat(2)
(. i.'. ( RM-237 AH-1 October 1969 ON THE EQUIVALENCE OF A SET OF MUTUALLY ORTHOGONAL LATIN SQUARES WITH OTHER COMBINATORIAL SYSTEMS (1) By A-. Hedayat(2) ( 1) (2) This research was supported by NSF grant
More informationTHE CLASSIFICATION OF PLANAR MONOMIALS OVER FIELDS OF PRIME SQUARE ORDER
THE CLASSIFICATION OF PLANAR MONOMIALS OVER FIELDS OF PRIME SQUARE ORDER ROBERT S COULTER Abstract Planar functions were introduced by Dembowski and Ostrom in [3] to describe affine planes possessing collineation
More informationGENERATING TERNARY SIMPLEX CODES ARISING FROM COMPLEX HADAMARD MATRICES
GENERATING TERNARY SIMPLEX CODES ARISING FROM COMPLEX HADAMARD MATRICES ABSTRACT Chandradeo Prasad Assistant Professor, Department. Of CSE, RGIT, Koderma, (India) In this paper, simplex codes are constructed
More informationFoundations of Matrix Analysis
1 Foundations of Matrix Analysis In this chapter we recall the basic elements of linear algebra which will be employed in the remainder of the text For most of the proofs as well as for the details, the
More informationTopic 3. Design of Sequences with Low Correlation
Topic 3. Design of Sequences with Low Correlation M-sequences and Quadratic Residue Sequences 2 Multiple Trace Term Sequences and WG Sequences 3 Gold-pair, Kasami Sequences, and Interleaved Sequences 4
More informationAFOSR Report No. ON A CLASS OF ERROR CORRECTING BINARY GROUP CODES by R. C. Bose and D. K. Ray-Chaudhuri September" 1959
[ I UNIVERSITY OF NORTH CAROLmA Department of Statistics Chapel Hill" N. C. Mathematical SCiences Directorate Air Force Office of Scientific Research Washington 25" D. c. AFOSR Report No. ON A CLASS OF
More informationFigure 9.1: A Latin square of order 4, used to construct four types of design
152 Chapter 9 More about Latin Squares 9.1 Uses of Latin squares Let S be an n n Latin square. Figure 9.1 shows a possible square S when n = 4, using the symbols 1, 2, 3, 4 for the letters. Such a Latin
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 informationA new family of orthogonal Latin hypercube designs
isid/ms/2016/03 March 3, 2016 http://wwwisidacin/ statmath/indexphp?module=preprint A new family of orthogonal Latin hypercube designs Aloke Dey and Deepayan Sarkar Indian Statistical Institute, Delhi
More informationQuantum LDPC Codes Derived from Combinatorial Objects and Latin Squares
Codes Derived from Combinatorial Objects and s Salah A. Aly & Latin salah at cs.tamu.edu PhD Candidate Department of Computer Science Texas A&M University November 11, 2007 Motivation for Computers computers
More information1 Linear Algebra Problems
Linear Algebra Problems. Let A be the conjugate transpose of the complex matrix A; i.e., A = A t : A is said to be Hermitian if A = A; real symmetric if A is real and A t = A; skew-hermitian if A = A and
More informationEIGENVALUES OF THE ADJACENCY MATRIX OF CUBIC LATTICE GRAPHS
PACIFIC JOURNAL OF MATHEMATICS Vol. 29, No. 3, 1969 EIGENVALUES OF THE ADJACENCY MATRIX OF CUBIC LATTICE GRAPHS RENU LASKAR A cubic lattice graph is defined to be a graph G, whose vertices are the ordered
More informationarxiv: v1 [math.co] 27 Jul 2015
Perfect Graeco-Latin balanced incomplete block designs and related designs arxiv:1507.07336v1 [math.co] 27 Jul 2015 Sunanda Bagchi Theoretical Statistics and Mathematics Unit Indian Statistical Institute
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 informationDivision of Trinomials by Pentanomials and Orthogonal Arrays
Division of Trinomials by Pentanomials and Orthogonal Arrays School of Mathematics and Statistics Carleton University daniel@math.carleton.ca Joint work with M. Dewar, L. Moura, B. Stevens and Q. Wang
More informationFinite Mathematics. Nik Ruškuc and Colva M. Roney-Dougal
Finite Mathematics Nik Ruškuc and Colva M. Roney-Dougal September 19, 2011 Contents 1 Introduction 3 1 About the course............................. 3 2 A review of some algebraic structures.................
More informationCONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS
Statistica Sinica 23 (2013), 451-466 doi:http://dx.doi.org/10.5705/ss.2011.092 CONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS Jun Li and Peter Z. G. Qian Opera Solutions and
More informationSome Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties
Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties HONGQUAN XU Department of Statistics, University of California, Los Angeles, CA 90095-1554, U.S.A. (hqxu@stat.ucla.edu)
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 information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationb 1 b 2.. b = b m A = [a 1,a 2,...,a n ] where a 1,j a 2,j a j = a m,j Let A R m n and x 1 x 2 x = x n
Lectures -2: Linear Algebra Background Almost all linear and nonlinear problems in scientific computation require the use of linear algebra These lectures review basic concepts in a way that has proven
More informationRanks of Hadamard Matrices and Equivalence of Sylvester Hadamard and Pseudo-Noise Matrices
Operator Theory: Advances and Applications, Vol 1, 1 13 c 27 Birkhäuser Verlag Basel/Switzerland Ranks of Hadamard Matrices and Equivalence of Sylvester Hadamard and Pseudo-Noise Matrices Tom Bella, Vadim
More informationLecture 15 Review of Matrix Theory III. Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore
Lecture 15 Review of Matrix Theory III Dr. Radhakant Padhi Asst. Professor Dept. of Aerospace Engineering Indian Institute of Science - Bangalore Matrix An m n matrix is a rectangular or square array of
More information3 (Maths) Linear Algebra
3 (Maths) Linear Algebra References: Simon and Blume, chapters 6 to 11, 16 and 23; Pemberton and Rau, chapters 11 to 13 and 25; Sundaram, sections 1.3 and 1.5. The methods and concepts of linear algebra
More informationAUTOMORPHISMS OF ORDER TWO*
AUTOMORPHISMS OF ORDER TWO* BY G. A. MILLER 1. Introduction. If an operator t transforms a group G into itself without being commutative with each operator of G, and if t2 is commutative with each operator
More informationON A METHOD OF SUM COMPOSITION OF ORTHOGONAL LATIN SQUARES. * Michigan State University
RM-238 AH-2 ES-12 November 1969 ON A METHOD OF SUM COMPOSTON OF ORTHOGONAL LATN SQUARES. * By A. Hedayat1) and E. Seiden Michigan State University * This research was supported by NH GM-05900-11 grant
More informationChapter 10 Combinatorial Designs
Chapter 10 Combinatorial Designs BIBD Example (a,b,c) (a,b,d) (a,c,e) (a,d,f) (a,e,f) (b,c,f) (b,d,e) (b,e,f) (c,d,e) (c,d,f) Here are 10 subsets of the 6 element set {a, b, c, d, e, f }. BIBD Definition
More informationSPHERE PACKINGS CONSTRUCTED FROM BCH AND JUSTESEN CODES
SPHERE PACKINGS CONSTRUCTED FROM BCH AND JUSTESEN CODES N. J. A. SLOANE Abstract. Bose-Chaudhuri-Hocquenghem and Justesen codes are used to pack equa spheres in M-dimensional Euclidean space with density
More informationMUTUALLY ORTHOGONAL LATIN SQUARES AND THEIR USES
MUTUALLY ORTHOGONAL LATIN SQUARES AND THEIR USES LOKESH DWIVEDI M.Sc. (Agricultural Statistics), Roll No. 449 I.A.S.R.I., Library Avenue, New Delhi 0 02 Chairperson: Dr. Cini Varghese Abstract: A Latin
More informationOrthogonal arrays obtained by repeating-column difference matrices
Discrete Mathematics 307 (2007) 246 261 www.elsevier.com/locate/disc Orthogonal arrays obtained by repeating-column difference matrices Yingshan Zhang Department of Statistics, East China Normal University,
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 informationS. Lie has thrown much new light on this operation. The assumption
600 MATHEMATICS: A. E. ROSS PRoc. N. A. S. The operation of finding the limit of an infinite series has been one of the most fruitful operations of all mathematics. While this is not a group operation
More informationOn the Construction and Decoding of Cyclic LDPC Codes
On the Construction and Decoding of Cyclic LDPC Codes Chao Chen Joint work with Prof. Baoming Bai from Xidian University April 30, 2014 Outline 1. Introduction 2. Construction based on Idempotents and
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 informationPart 23. Latin Squares. Contents. 1 Latin Squares. Printed version of the lecture Discrete Mathematics on 4. December 2012
Part 23 Latin Squares Printed version of the lecture Discrete Mathematics on 4. December 2012 Tommy R. Jensen, Department of Mathematics, KNU 23.1 Contents 1 Latin Squares 1 2 Orthogonal Latin Squares
More informationThe number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes
The number of different reduced complete sets of MOLS corresponding to the Desarguesian projective planes Vrije Universiteit Brussel jvpoucke@vub.ac.be joint work with K. Hicks, G.L. Mullen and L. Storme
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More information--------------------------------------------------------------------------------------------- Math 6023 Topics: Design and Graph Theory ---------------------------------------------------------------------------------------------
More informationMUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS. 1. Introduction
MUTUALLY ORTHOGONAL FAMILIES OF LINEAR SUDOKU SOLUTIONS JOHN LORCH Abstract For a class of linear sudoku solutions, we construct mutually orthogonal families of maximal size for all square orders, and
More informationClass-r hypercubes and related arrays
Class-r hypercubes and related arrays David Thomson Carleton University, Ottawa ON joint work with John Ethier, Melissa Huggan Gary L. Mullen, Daniel Panario and Brett Stevens D. Thomson (Carleton) Class-r
More informationGolomb-Lempel Construction of Costas Arrays Revisited
International Journal of Mathematics and Computer Science, 10(2015), no. 2, 239 249 M CS Golomb-Lempel Construction of Costas Arrays Revisited Ishani Barua University of Engineering & Management Jaipur,
More informationAnale. Seria Informatică. Vol. XIII fasc Annals. Computer Science Series. 13 th Tome 1 st Fasc. 2015
24 CONSTRUCTION OF ORTHOGONAL ARRAY-BASED LATIN HYPERCUBE DESIGNS FOR DETERMINISTIC COMPUTER EXPERIMENTS Kazeem A. Osuolale, Waheed B. Yahya, Babatunde L. Adeleke Department of Statistics, University of
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
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 informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationAlgebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix
Algebra & Trig. I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural
More informationSome matrices of Williamson type
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1973 Some matrices of Williamson type Jennifer Seberry University of Wollongong,
More informationQuasigroups and Related Systems 9 (2002), Galina B. Belyavskaya. Abstract
Quasigroups and Related Systems 9 (2002), 1 17 Quasigroup power sets and cyclic Ssystems Galina B. Belyavskaya Abstract We give new constructions of power sets of quasigroups (latin squares) based on pairwise
More informationA SIMPLE METHOD FOR CONSTRUCTING ORTHOGONAL ARRAYS BY THE KRONECKER SUM
Jrl Syst Sci & Complexity (2006) 19: 266 273 A SIMPLE METHOD FOR CONSTRUCTING ORTHOGONAL ARRAYS BY THE KRONECKER SUM Yingshan ZHANG Weiguo LI Shisong MAO Zhongguo ZHENG Received: 14 December 2004 / Revised:
More informationµ INVARIANT OF NANOPHRASES YUKA KOTORII TOKYO INSTITUTE OF TECHNOLOGY GRADUATE SCHOOL OF SCIENCE AND ENGINEERING 1. Introduction A word will be a sequ
µ INVARIANT OF NANOPHRASES YUKA KOTORII TOKYO INSTITUTE OF TECHNOLOGY GRADUATE SCHOOL OF SCIENCE AND ENGINEERING 1. Introduction A word will be a sequence of symbols, called letters, belonging to a given
More information2. Matrix Algebra and Random Vectors
2. Matrix Algebra and Random Vectors 2.1 Introduction Multivariate data can be conveniently display as array of numbers. In general, a rectangular array of numbers with, for instance, n rows and p columns
More informationGROUPS. Chapter-1 EXAMPLES 1.1. INTRODUCTION 1.2. BINARY OPERATION
Chapter-1 GROUPS 1.1. INTRODUCTION The theory of groups arose from the theory of equations, during the nineteenth century. Originally, groups consisted only of transformations. The group of transformations
More informationBinary Primitive BCH Codes. Decoding of the BCH Codes. Implementation of Galois Field Arithmetic. Implementation of Error Correction
BCH Codes Outline Binary Primitive BCH Codes Decoding of the BCH Codes Implementation of Galois Field Arithmetic Implementation of Error Correction Nonbinary BCH Codes and Reed-Solomon Codes Preface The
More informationCONSTRUCTION OF SLICED ORTHOGONAL LATIN HYPERCUBE DESIGNS
Statistica Sinica 23 (2013), 1117-1130 doi:http://dx.doi.org/10.5705/ss.2012.037 CONSTRUCTION OF SLICED ORTHOGONAL LATIN HYPERCUBE DESIGNS Jian-Feng Yang, C. Devon Lin, Peter Z. G. Qian and Dennis K. J.
More information1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
More informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationOn q-ary optimal equitable symbol weight codes
On q-ary optimal equitable symbol weight codes 1/20 On q-ary optimal equitable symbol weight codes L. A. Bassalygo, V.A. Zinoviev A.A. Kharkevich Institute for Problems of Information Transmission, Moscow,
More informationNew Constructions of Difference Matrices
New Constructions of Difference Matrices Department of Mathematics, Simon Fraser University Joint work with Koen van Greevenbroek Outline Difference matrices Basic results, motivation, history Construction
More informationMatrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...
Chapter Matrices We review the basic matrix operations What is a Matrix? An array of numbers a a n A = a m a mn with m rows and n columns is a m n matrix Element a ij in located in position (i, j The elements
More informationA talk given at University of Wisconsin at Madison (April 6, 2006). Zhi-Wei Sun
A tal given at University of Wisconsin at Madison April 6, 2006. RECENT PROGRESS ON CONGRUENCES INVOLVING BINOMIAL COEFFICIENTS Zhi-Wei Sun Department of Mathematics Nanjing University Nanjing 210093,
More informationREVERSALS ON SFT S. 1. Introduction and preliminaries
Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems
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 informationON THE LEAST PRIMITIVE ROOT MODULO p 2
ON THE LEAST PRIMITIVE ROOT MODULO p 2 S. D. COHEN, R. W. K. ODONI, AND W. W. STOTHERS Let h(p) be the least positive primitive root modulo p 2. Burgess [1] indicated that his work on character sums yields
More informationSome Open Problems Arising from my Recent Finite Field Research
Some Open Problems Arising from my Recent Finite Field Research Gary L. Mullen Penn State University mullen@math.psu.edu July 13, 2015 Some Open Problems Arising from myrecent Finite Field Research July
More informationTridiagonal pairs in algebraic graph theory
University of Wisconsin-Madison Contents Part I: The subconstituent algebra of a graph The adjacency algebra The dual adjacency algebra The subconstituent algebra The notion of a dual adjacency matrix
More informationC 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 523 535 doi:10.7151/dmgt.1936 C 7 -DECOMPOSITIONS OF THE TENSOR PRODUCT OF COMPLETE GRAPHS R.S. Manikandan Department of Mathematics Bharathidasan University
More informationTriceratopisms of Latin Squares
Triceratopisms of Latin Squares Ian Wanless Joint work with Brendan McKay and Xiande Zhang Latin squares A Latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each
More informationHadamard ideals and Hadamard matrices with two circulant cores
Hadamard ideals and Hadamard matrices with two circulant cores Ilias S. Kotsireas a,1,, Christos Koukouvinos b and Jennifer Seberry c a Wilfrid Laurier University, Department of Physics and Computer Science,
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationOn the minimum distance of LDPC codes based on repetition codes and permutation matrices 1
Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory June 18-24, 216, Albena, Bulgaria pp. 168 173 On the minimum distance of LDPC codes based on repetition codes and permutation
More informationData Mining and Matrices
Data Mining and Matrices 05 Semi-Discrete Decomposition Rainer Gemulla, Pauli Miettinen May 16, 2013 Outline 1 Hunting the Bump 2 Semi-Discrete Decomposition 3 The Algorithm 4 Applications SDD alone SVD
More informationSYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 186, December 1973 SYMMETRICOMPLETIONS AND PRODUCTS OF SYMMETRIC MATRICES BY MORRIS NEWMAN ABSTRACT. We show that any vector of n relatively prime
More informationCheckered Hadamard Matrices of Order 16
Europ. J. Combinatorics (1998) 19, 935 941 Article No. ej980250 Checkered Hadamard Matrices of Order 16 R. W. GOLDBACH AND H. L. CLAASEN In this paper all the so-called checkered Hadamard matrices of order
More informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
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 informationGroups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems
Group Theory Groups Subgroups Normal subgroups Quotient groups Homomorphisms Cyclic groups Permutation groups Cayley s theorem Class equations Sylow theorems Groups Definition : A non-empty set ( G,*)
More informationOn the Shadow Geometries of W (23, 16)
On the of W (23, 16) Assaf Goldberger 1 Yossi Strassler 2 Giora Dula 3 1 School of Mathematical Sciences Tel-Aviv University 2 Dan Yishay 3 Department of Computer Science and Mathematics Netanya College
More informationHIDDEN PROJECTION PROPERTIES OF SOME NONREGULAR FRACTIONAL FACTORIAL DESIGNS AND THEIR APPLICATIONS 1
The Annals of Statistics 2003, Vol. 31, No. 3, 1012 1026 Institute of Mathematical Statistics, 2003 HIDDEN PROJECTION PROPERTIES OF SOME NONREGULAR FRACTIONAL FACTORIAL DESIGNS AND THEIR APPLICATIONS 1
More informationA NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS
Statistica Sinica 26 (2016), 1249-1267 doi:http://dx.doi.org/10.5705/ss.2014.029 A NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS Xue Yang 1,2, Jian-Feng Yang 2, Dennis K. J. Lin 3 and
More informationOn completing partial Latin squares with two filled rows and at least two filled columns
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 68(2) (2017), Pages 186 201 On completing partial Latin squares with two filled rows and at least two filled columns Jaromy Kuhl Donald McGinn Department of
More information