Mutually Pseudo-orthogonal Latin squares, difference matrices and LDPC codes
|
|
- Caren Thompson
- 5 years ago
- Views:
Transcription
1 Mutually Pseudo-orthogonal Latin squares, difference matrices and LDPC codes Asha Rao (Joint Work with Diane Donovan, Joanne Hall and Fatih Demirkale) 8th Australia New Zealand Mathematics Convention Melbourne Australia 10 December, 2014
2 Outline Introduction c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
3 Outline Introduction Subclass of Difference Covering Arrays c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
4 Outline Introduction Subclass of Difference Covering Arrays Constructing Pseudo-orthogonal Latin Squares c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
5 Outline Introduction Subclass of Difference Covering Arrays Constructing Pseudo-orthogonal Latin Squares LDPC Codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
6 Introduction Outline Introduction Subclass of Difference Covering Arrays Constructing Pseudo-orthogonal Latin Squares LDPC Codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
7 Introduction Difference Matrices A fundamental tool for constructing many combinatorial objects Have diverse applications, such as design of animal studies Coding Theory - Authentication Codes, LDPC codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
8 Introduction Generalisations of Difference Matrices Why Generalise? - because of existence constraints Holey Difference Matrices Difference Covering Arrays Difference Packing Arrays c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
9 Introduction Difference Matrix - Definition A Difference Matrix over an abelian group (G, +) of order n is an n k matrix Q = [q(i, j)] with entries from G such that for all pairs of columns 0 j, j k 1, j j j,j = {q(i, j) q(i, j ) 0 i n 1} contains every element of G equally often, say λ times. Notation: DM(n, k; λ) c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
10 Introduction Existence of Difference matrices DM(n, k; λ) does not exist if k > λn DM(n, 3; λ) does not exist if λ is odd and n is even and the Sylow 2-subgroup of G is cyclic in particular, if λ is odd, n is even and G = Z n or if λ is odd, and n 2 mod 4 c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
11 Introduction Generalisation: Difference Covering Array Given an abelian group (G, +) of order n A Difference Covering Array DCA(k, η; n) is an η k matrix Q = [q(i, j)] with entries from G such that, for all pairs of columns 0 j, j k 1, j j, the difference set j,j = {q(i, j) q(i, j ) 0 i η 1} contains every element of G at least once. Difference Packing Array DPA(k, η; n) if the difference set contains every element of G at most once. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
12 Introduction Some other twists! If (G, +) is the cyclic group, then the difference covering (packing) array is said to be cyclic. A cyclic DCA(k, n + 1; n), Q = [q(i, j)] (0 i n, 0 j k 1), satisfies the reflection property if, for all columns j, 0 j k 2, and all rows i {0, 1,... (n 1)/2}, q(i, j) + q(n 1 i, j) = n 1. We may assume that the last row and last column of a DCA(k, η; n) contain all zeros. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
13 Subclass of Difference Covering Arrays Outline Introduction Subclass of Difference Covering Arrays Constructing Pseudo-orthogonal Latin Squares LDPC Codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
14 Subclass of Difference Covering Arrays DCA with particular Properties Why? Because these properties will build connections to pseudo-orthogonal Latin squares Want DCA(k, n + 1; n), Q = [q(i, j)], (0 i n, 0 j k 1) satisfying the properties: P1. the entry 0 G occurs at least twice in each column of Q, and P2. for all pairs of distinct columns j and j, j k 1 j, j,j = {q(i, j) q(i, j ) 0 i n 1} = G \ {0}, if G is the cyclic group over Z n, then these conditions imply that for all distinct columns j and j, j k 1 j, j,j = {0, 1, 2,..., n/2, n/2,..., n 1} with repetition retained. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
15 Constructing Pseudo-orthogonal Latin Squares Outline Introduction Subclass of Difference Covering Arrays Constructing Pseudo-orthogonal Latin Squares LDPC Codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
16 Constructing Pseudo-orthogonal Latin Squares Latin Squares A Latin square of order n is an n n array in which each of the symbols of Z n occurs once in every row and once in every column. Two Latin squares A = [a(i, j)] and B = [b(i, j)], of order n, are said to be orthogonal if O = {(a(i, j), b(i, j)) 0 i, j n 1} = Z n Z n. Difference matrices can be used to construct sets of mutually orthogonal Latin squares (MOLS). There exist significant existence questions for sets of MOLS. There is no pair of MOLS(6), however it is not known if there exists a set of three MOLS(10), or four MOLS(22) etc. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
17 Constructing Pseudo-orthogonal Latin Squares Pseudo-orthogonal Latin Squares Raghavarao, Shrikhande and Shrikhande [2002] vary the mutually orthogonal condition Each symbol of one Latin square is paired with every symbol in the other once, except except for one symbol with which it is paired twice and And one with which it is not paired at all But, are Pseudo-orthogonal Latin Squares useful? Applications to multi-factor crossover designs in animal husbandry for example. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
18 Constructing Pseudo-orthogonal Latin Squares Near Mutually Orthogonal Latin Squares Here we are interested in a special class of Pseudo-orthogonal Latin squares The set O does not contain the pair (a, a), for any a Z n. Question: Can we use difference techniques to construct mutually pseudo-orthogonal Latin squares? Yes, first done by Raghavarao, Shrikhande and Shrikhande in 2002, Theorem: If there exists a cyclic DCA(t + 1, 2p + 1; 2p), Q = [q (i, j)], which satisfies Property P1 and P2, then there exists a set of t pseudo-orthogonal Latin squares of order 2p. General Constructions by Li and van Rees in c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
19 Constructing Pseudo-orthogonal Latin Squares A cyclic DCA with reflection property Theorem Let f to be a natural number and m = 4k + 2 where k is a non-negative integer, such that gcd(f, 4m) = 2, gcd(f 1, 4m) = 1, and f 2 + f 2 2m mod 4m. Then a DCA(4, 4m + 1; 4m) with reflection property exists. Corollary For k such that k 1 mod 3, we can always construct a DCA(4, 4m + 1; 4m) as described above. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
20 Constructing Pseudo-orthogonal Latin Squares The Construction of a cyclic DCA with reflection property Intervals I 1 I 2 I 3 I 4 q(a, 0) = a q(a, 1) = b(a) q(a, 2) = c(a) [0, m 1] [m, 2m 1] [2m, 3m 1] [3m, 4m 1] (a + 1)f 1 (a + 1)f 1 af af (a+1)(2m f + 2) 1 a(2m f + 2) m (a+1)(2m f + 2) + m 1 a(2m f + 2) b(a) a (a + 1)(f 1) (a + 1)(f 1) a(f 1) a(f 1) c(a) a (a+1)(2m f + 1) a(2m f + 1) m (a+1)(2m f + 1) + m a(2m f + 1) c(a) (a + 1)(2m a(2m 2f +2) a(2m 2f +2)+ a(2m 2f + 2) b(a) 2f + 2) f m + 1 3m f + 1 c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
21 LDPC Codes Outline Introduction Subclass of Difference Covering Arrays Constructing Pseudo-orthogonal Latin Squares LDPC Codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
22 LDPC Codes LDPC Codes - What are they? Linear error-correcting codes obtained from sparse bipartite graphs. First invented by Robert Gallagher in the 19060s. Highly sought after for high-speed communication and data storage The parity-check matrix is sparse. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
23 LDPC Codes Example Here is the parity check matrix of the [6,3] LDPC code. H = c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
24 LDPC Codes Constructing LDPC Codes Gallagher s proposed construction: randomly assign 1s to positions in H subject to constraints Difficult to randomly construct good high-rate LDPC codes of short and moderate length Why? Parity-check matrices are very dense compared to low-rate codes. Need structured LDPC codes such as finite geometry LDPC codes c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
25 LDPC Codes QC-LDPC Codes Quasi-cyclic LDPC codes are well suited for hardware implementation Vasic and Milenkovic (2004) propose construction from cyclic difference families. These too have restricted lengths c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
26 LDPC Codes Example of CDF CDF(13,3,1) over Z 13 The Blocks B 1 = {0, 1, 4} and B 2 = {0, 2, 7} are the base block of a (13, 3, 1) CDF. D (1) = D (2) = c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
27 LDPC Codes Example of QC-LDPC Take the action of G = Z v on the base blocks to get BIBD(v, c, 1). The orbits of the base blocks of the CDF(13,3,1) give BIBD(13,3,1) The incidence matrix of the BIBD is the parity-check matrix H of the LDPC code. H has 13 rows and 26 columns and is of the form H = [H 1, H 2 ] Each column has weight 3. c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
28 LDPC Codes Furture Work Extending the construction to get LDPC codes from DCA(t + 1, 2p + 1, ; 2p). Would the properties of the LDPC codes thus obtained be better? c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
29 LDPC Codes Any Questions c Asha Rao (ANZMC) MNOLS, DM, LDPC 10 December, / 26
Part 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 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 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 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 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 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 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 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 informationConstruction of Protographs for QC LDPC Codes With Girth Larger Than 12 1
Construction of Protographs for QC LDPC Codes With Girth Larger Than 12 1 Sunghwan Kim, Jong-Seon No School of Electrical Eng. & Com. Sci. Seoul National University, Seoul, Korea Email: {nodoubt, jsno}@snu.ac.kr
More informationLecture 1: Latin Squares!
Latin Squares Instructor: Paddy Lecture : Latin Squares! Week of Mathcamp 00 Introduction Definition. A latin square of order n is a n n array, filled with symbols {,... n}, such that no symbol is repeated
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 informationThe candidates are advised that they must always show their working, otherwise they will not be awarded full marks for their answers.
MID SWEDEN UNIVERSITY TFM Examinations 2006 MAAB16 Discrete Mathematics B Duration: 5 hours Date: 7 June 2006 There are EIGHT questions on this paper and you should answer as many as you can in the time
More informationLDPC Codes. Intracom Telecom, Peania
LDPC Codes Alexios Balatsoukas-Stimming and Athanasios P. Liavas Technical University of Crete Dept. of Electronic and Computer Engineering Telecommunications Laboratory December 16, 2011 Intracom Telecom,
More informationTransversals in Latin Squares
Transversals in Latin Squares Ian Wanless Monash University Australia Loops 07 workshop, Prague, Aug 2007 A latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each
More informationSome V(12,t) vectors and designs from difference and quasi-difference matrices
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 4 (28), Pages 69 85 Some V(12,t) vectors and designs from difference and quasi-difference matrices R Julian R Abel School of Mathematics and Statistics University
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 informationGeneralizing Clatworthy Group Divisible Designs. Julie Rogers
Generalizing Clatworthy Group Divisible Designs by Julie Rogers A dissertation submitted to the Graduate Faculty of Auburn University in partial fulfillment of the requirements for the Degree of Doctor
More informationBalanced Nested Designs and Balanced n-ary Designs
Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki
More informationSets of MOLSs generated from a single Latin square
Sets of MOLSs generated from a single Latin square Hau Chan and Dinesh G Sarvate Abstract The aim of this note is to present an observation on the families of square matrices generated by repeated application
More informationON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS
Hacettepe Journal of Mathematics and Statistics Volume 35 (2) (2006), 235 240 ON THE CONSTRUCTION OF ORTHOGONAL BALANCED INCOMPLETE BLOCK DESIGNS Hülya Bayrak and Hanife Bulut Received 20 : 02 : 2006 :
More information3360 LECTURES. R. Craigen. October 15, 2016
3360 LECTURES R. Craigen October 15, 2016 Introduction to designs Chapter 9 In combinatorics, a design consists of: 1. A set V elements called points (or: varieties, treatments) 2. A collection B of subsets
More informationOrthogonal & Magic Cayley-Sudoku Tables
Orthogonal & Magic Cayley-Sudoku Tables Michael Ward & Rosanna Mersereau 13 Western Oregon University XXXII Ohio State-Denison Mathematics Conference May 2014 1 / 72 Speaker s Qualifications Cayley-Sudoku
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 informationA COMPOSITION THEOREM FOR GENERALIZED BHASKAR RAO DESIGNS. William Douglas Palmer
A COMPOSITION THEOREM FOR GENERALIZED BHASKAR RAO DESIGNS William Douglas Palmer The School of Mathematics and Statistics and The School of Teaching and Curriculum Studies The University of Sydney Abstract:
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More information1 I A Q E B A I E Q 1 A ; E Q A I A (2) A : (3) A : (4)
Latin Squares Denition and examples Denition. (Latin Square) An n n Latin square, or a latin square of order n, is a square array with n symbols arranged so that each symbol appears just once in each row
More informationA Latin Square of order n is an n n array of n symbols where each symbol occurs once in each row and column. For example,
1 Latin Squares A Latin Square of order n is an n n array of n symbols where each symbol occurs once in each row and column. For example, A B C D E B C A E D C D E A B D E B C A E A D B C is a Latin square
More informationStructured Low-Density Parity-Check Codes: Algebraic Constructions
Structured Low-Density Parity-Check Codes: Algebraic Constructions Shu Lin Department of Electrical and Computer Engineering University of California, Davis Davis, California 95616 Email:shulin@ece.ucdavis.edu
More informationMa/CS 6a Class 28: Latin Squares
Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1
More informationSymmetric configurations for bipartite-graph codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 2008, Pamporovo, Bulgaria pp. 63-69 Symmetric configurations for bipartite-graph codes Alexander Davydov adav@iitp.ru
More informationTRANSVERSALS OF LATIN SQUARES AND THEIR GENERALIZATIONS
PACIFIC JOURNAL OF MATHEMATICS Vol. 59, No. 2, 1975 TRANSVERSALS OF LATIN SQUARES AND THEIR GENERALIZATIONS S. K. STEIN The main theme in this paper is the existence of a transversal with many distinct
More informationQuasi-cyclic Low Density Parity Check codes with high girth
Quasi-cyclic Low Density Parity Check codes with high girth, a work with Marta Rossi, Richard Bresnan, Massimilliano Sala Summer Doctoral School 2009 Groebner bases, Geometric codes and Order Domains Dept
More informationEvery SOMA(n 2, n) is Trojan
Every SOMA(n 2, n) is Trojan John Arhin 1 Marlboro College, PO Box A, 2582 South Road, Marlboro, Vermont, 05344, USA. Abstract A SOMA(k, n) is an n n array A each of whose entries is a k-subset of a knset
More informationConstruction and Encoding of QC-LDPC Codes Using Group Rings
1 Construction and Encoding of QC-LDPC Codes Using Group Rings Hassan Khodaiemehr and Dariush Kiani arxiv:1701.00210v1 [cs.it] 1 Jan 2017 Abstract Quasi-cyclic (QC) low-density parity-check (LDPC) codes
More informationRECURSIVE CONSTRUCTION OF (J, L) QC LDPC CODES WITH GIRTH 6. Communicated by Dianhua Wu. 1. Introduction
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol 5 No 2 (2016, pp 11-22 c 2016 University of Isfahan wwwcombinatoricsir wwwuiacir RECURSIVE CONSTRUCTION OF (J, L QC LDPC
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 informationMa/CS 6a Class 28: Latin Squares
Ma/CS 6a Class 28: Latin Squares By Adam Sheffer Latin Squares A Latin square is an n n array filled with n different symbols, each occurring exactly once in each row and exactly once in each column. 1
More informationCombinatorial Group Testing for DNA Library Screening
0-0 Combinatorial Group Testing for DNA Library Screening Ying Miao University of Tsukuba 0-1 Contents 1. Introduction 2. An Example 3. General Case 4. Consecutive Positives Case 5. Bayesian Network Pool
More informationMutually orthogonal latin squares (MOLS) and Orthogonal arrays (OA)
and Orthogonal arrays (OA) Bimal Roy Indian Statistical Institute, Kolkata. Bimal Roy, Indian Statistical Institute, Kolkata. and Orthogonal arrays (O Outline of the talk 1 Latin squares 2 3 Bimal Roy,
More informationPlanes and MOLS. Ian Wanless. Monash University
Planes and MOLS Ian Wanless Monash University A few of our favourite things A projective plane of order n. An orthogonal array OA(n + 1, n) (strength 2) A (complete) set of n 1 MOLS(n). A classical result
More informationCONSTRUCTION OF RECTANGULAR PBIB DESIGNS
Journal of Scientific Research Vol. 55, 2011 : 103-110 Banaras Hindu University, Varanasi ISSN : 0447-9483 CONSTRUCTION OF RECTANGULAR PBIB DESIGNS Hemant Kr. Singh *, J.S. Parihar **, R.D. Singh * & Vipul
More informationDesign of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal
Design of Non-Binary Quasi-Cyclic LDPC Codes by Absorbing Set Removal Behzad Amiri Electrical Eng. Department University of California, Los Angeles Los Angeles, USA Email: amiri@ucla.edu Jorge Arturo Flores
More informationALTHOUGH a big effort has been made to construct
1 Low-Density Parity-Check Codes From Transversal Designs With Improved Stopping Set Distributions Alexander Gruner, Student Member, IEEE, and Michael Huber, Member, IEEE arxiv:1306.111v1 [cs.it] 21 Jun
More informationOn the minimum distance of LDPC codes based on repetition codes and permutation matrices
On the minimum distance of LDPC codes based on repetition codes and permutation matrices Fedor Ivanov Email: fii@iitp.ru Institute for Information Transmission Problems, Russian Academy of Science XV International
More informationCodes on graphs and iterative decoding
Codes on graphs and iterative decoding Bane Vasić Error Correction Coding Laboratory University of Arizona Prelude Information transmission 0 0 0 0 0 0 Channel Information transmission signal 0 0 threshold
More informationSome Applications of pq-groups in Graph Theory
Some Applications of pq-groups in Graph Theory Geoffrey Exoo Department of Mathematics and Computer Science Indiana State University Terre Haute, IN 47809 g-exoo@indstate.edu January 25, 2002 Abstract
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 informationConstruction of LDPC codes
Construction of LDPC codes Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete July 1, 2009 Telecommunications Laboratory (TUC) Construction of LDPC codes July 1, 2009
More informationStopping, and Trapping Set Analysis
LDPC Codes Based on Latin Squares: Cycle Structure, Stopping, and Trapping Set Analysis Stefan Laendner and Olgica Milenkovic Electrical and Computer Engineering Department University of Colorado, Boulder,
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 informationA three-factor product construction for mutually orthogonal latin squares
A three-factor product construction for mutually orthogonal latin squares Peter J. Dukes (joint work with Alan C.H. Ling, UVM) June 17, 2014 Introduction Latin squares and MOLS Product construction Main
More informationAunu Integer Sequence as Non-Associative Structure and Their Graph Theoretic Properties
Advances in Pure Mathematics, 2016, 6, 409-419 Published Online May 2016 in SciRes. http://www.scirp.org/journal/apm http://dx.doi.org/10.4236/apm.2016.66028 Aunu Integer Sequence as Non-Associative Structure
More informationGraph-based codes for flash memory
1/28 Graph-based codes for flash memory Discrete Mathematics Seminar September 3, 2013 Katie Haymaker Joint work with Professor Christine Kelley University of Nebraska-Lincoln 2/28 Outline 1 Background
More informationNon-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs
Non-existence of strongly regular graphs with feasible block graph parameters of quasi-symmetric designs Rajendra M. Pawale, Mohan S. Shrikhande*, Shubhada M. Nyayate August 22, 2015 Abstract A quasi-symmetric
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 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 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 informationBose's method of differences applied to construct Bhaskar Rao designs
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 1998 Bose's method of differences applied to construct Bhaskar Rao designs
More informationLatin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless)
Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless) Outline 1)The basic idea 2) Motivation 3) Summary of the group case 4) Results
More informationOrthogonal trades in complete sets of MOLS
Orthogonal trades in complete sets of MOLS Nicholas J. Cavenagh Department of Mathematics and Statistics University of Waikato New Zealand Diane M. Donovan nickc@waikato.ac.nz Centre for Discrete Mathematics
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 informationLow-Density Arrays of Circulant Matrices: Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes
Low-Density Arrays of Circulant Matrices: 1 Rank and Row-Redundancy Analysis, and Quasi-Cyclic LDPC Codes Qin Huang 1 and Keke Liu 2 and Zulin Wang 1 arxiv:12020702v1 [csit] 3 Feb 2012 1 School of Electronic
More informationSPA decoding on the Tanner graph
SPA decoding on the Tanner graph x,(i) q j,l = P(v l = x check sums A l \ {h j } at the ith iteration} x,(i) σ j,l = Σ P(s = 0 v = x,{v : t B(h )\{l}}) q {vt : t B(h j )\{l}} j l t j t B(h j )\{l} j,t
More informationLatin Squares with No Small Odd Plexes
Latin Squares with No Small Odd Plexes Judith Egan, Ian M. Wanless School of Mathematical Sciences, Monash University, Victoria 3800, Australia, E-mail: judith.egan@sci.monash.edu.au; ian.wanless@sci.monash.edu.au
More informationConstruction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor
Construction of low complexity Array based Quasi Cyclic Low density parity check (QC-LDPC) codes with low error floor Pravin Salunkhe, Prof D.P Rathod Department of Electrical Engineering, Veermata Jijabai
More informationOn 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 informationDecomposing dense bipartite graphs into 4-cycles
Decomposing dense bipartite graphs into 4-cycles Nicholas J. Cavenagh Department of Mathematics The University of Waikato Private Bag 3105 Hamilton 3240, New Zealand nickc@waikato.ac.nz Submitted: Jun
More informationHOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS
HOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS 1. Chapter 3, Problem 18 (Graded) Let H and K be subgroups of G. Then e, the identity, must be in H and K, so it must be in H K. Thus, H K is nonempty, so we can
More informationChapter 1. Latin Squares. 1.1 Latin Squares
Chapter Latin Squares. Latin Squares Definition... A latin square of order n is an n n array in which n distinct symbols are arranged so that each symbol occurs exactly once in each row and column. If
More informationCodes on Graphs. Telecommunications Laboratory. Alex Balatsoukas-Stimming. Technical University of Crete. November 27th, 2008
Codes on Graphs Telecommunications Laboratory Alex Balatsoukas-Stimming Technical University of Crete November 27th, 2008 Telecommunications Laboratory (TUC) Codes on Graphs November 27th, 2008 1 / 31
More informationResearch Article Structured LDPC Codes over Integer Residue Rings
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2008, Article ID 598401, 9 pages doi:10.1155/2008/598401 Research Article Structured LDPC Codes over Integer
More informationExistence of doubly near resolvable (v, 4, 3)-BIBDs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 109 124 Existence of doubly near resolvable (v, 4, 3)-BIBDs R. Julian R. Abel Nigel H. N. Chan School of Mathematics and Statistics University
More informationINTRODUCTION MATHIEU GROUPS. Lecture 5: Sporadic simple groups. Sporadic simple groups. Robert A. Wilson. LTCC, 10th November 2008
Lecture 5: Sporadic simple groups Robert A. Wilson INTRODUCTION Queen Mary, University of London LTCC, 0th November 2008 Sporadic simple groups The 26 sporadic simple groups may be roughly divided into
More informationQuasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 53, NO 8, AUGUST 2007 2885 n possible values If the parity check is satisfied, the error probability is closely approximated by the probability of two bit errors,
More informationECEN 5022 Cryptography
Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,
More informationA Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design
A Class of Quantum LDPC Codes Derived from Latin Squares and Combinatorial Design Salah A Aly Department of Computer Science, Texas A&M University, College Station, TX 77843-3112, USA Email: salah@cstamuedu
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 informationKevin James. p-groups, Nilpotent groups and Solvable groups
p-groups, Nilpotent groups and Solvable groups Definition A maximal subgroup of a group G is a proper subgroup M G such that there are no subgroups H with M < H < G. Definition A maximal subgroup of a
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 informationSequenceable Groups and Related Topics
Sequenceable Groups and Related Topics M. A. Ollis Marlboro College, P.O. Box A, Marlboro, VT 05344, USA. matt@marlboro.edu Submitted: Nov 15, 2001; Accepted: Aug 12, 2002; Version 1 published: Aug 12,
More informationLDPC Codes. Slides originally from I. Land p.1
Slides originally from I. Land p.1 LDPC Codes Definition of LDPC Codes Factor Graphs to use in decoding Decoding for binary erasure channels EXIT charts Soft-Output Decoding Turbo principle applied to
More informationImprimitive symmetric graphs with cyclic blocks
Imprimitive symmetric graphs with cyclic blocks Sanming Zhou Department of Mathematics and Statistics University of Melbourne Joint work with Cai Heng Li and Cheryl E. Praeger December 17, 2008 Outline
More informationA Markov chain for certain triple systems
A Markov chain for certain triple systems Peter J. Cameron Queen Mary, University of London and Gonville & Caius College, Cambridge INI Workshop on Markov Chain Monte Carlo methods March 2008 Latin squares
More informationChapter 2. Ma 322 Fall Ma 322. Sept 23-27
Chapter 2 Ma 322 Fall 2013 Ma 322 Sept 23-27 Summary ˆ Matrices and their Operations. ˆ Special matrices: Zero, Square, Identity. ˆ Elementary Matrices, Permutation Matrices. ˆ Voodoo Principle. What is
More informationProperties and Classification of the Wheels of the OLS Polytope.
Properties and Classification of the Wheels of the OLS Polytope. G. Appa 1, D. Magos 2, I. Mourtos 1 1 Operational Research Department, London School of Economics. email: {g.appa, j.mourtos}@lse.ac.uk
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 informationChapter 0: Preliminaries
Chapter 0: Preliminaries Adam Sheffer March 28, 2016 1 Notation This chapter briefly surveys some basic concepts and tools that we will use in this class. Graduate students and some undergrads would probably
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 informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationAbsorbing Set Spectrum Approach for Practical Code Design
Absorbing Set Spectrum Approach for Practical Code Design Jiadong Wang, Lara Dolecek, Zhengya Zhang and Richard Wesel wjd@ee.ucla.edu, dolecek@ee.ucla.edu, zhengya@eecs.umich.edu, wesel@ee.ucla.edu Abstract
More informationOn the size of autotopism groups of Latin squares.
On the size of autotopism groups of Latin squares. Douglas Stones and Ian M. Wanless School of Mathematical Sciences Monash University VIC 3800 Australia {douglas.stones, ian.wanless}@sci.monash.edu.au
More informationMath 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9
Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,
More information11 Block Designs. Linear Spaces. Designs. By convention, we shall
11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,
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 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 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 informationConstructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach
Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach Shu Lin, Shumei Song, Lan Lan, Lingqi Zeng and Ying Y Tai Department of Electrical & Computer Engineering University of California,
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 informationNew Constructions for De Bruijn Tori
New Constructions for De Bruijn Tori Glenn Hurlbert Garth Isaak Dedicated to the memory of Tony Brewster Abstract A De Bruijn torus is a periodic d dimensional k ary array such that each n 1 n d k ary
More informationarxiv: v2 [math.co] 31 Jul 2015
The rainbow connection number of the power graph of a finite group arxiv:1412.5849v2 [math.co] 31 Jul 2015 Xuanlong Ma a Min Feng b,a Kaishun Wang a a Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal
More information