Corpus ID: 8173921

On circulant and two-circulant weighing matrices

  title={On circulant and two-circulant weighing matrices},
  author={K. Arasu and I. Kotsireas and C. Koukouvinos and J. Seberry},
  journal={Australas. J Comb.},
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants. In particular, we construct W (148, 144), W (152, 144), W (156, 144) which are listed as open in the second edition of the Handbook of Combinatorial Designs. We also fill a missing entry in Strassler’s table with answer “YES”, by constructing a circulant weighing matrix of order 142 with weight 100. ∗ Research partially supported by grants from NSF and AFOSR. The author thanks… Expand
A feasibility approach for constructing combinatorial designs of circulant type
This work proposes an optimization approach for constructing various classes of circulant combinatorial designs that can be defined in terms of autocorrelation, and explicitly construct two newcirculant weighing matrices, whose existence was previously marked as unresolved in the most recent version of Strassler’s table. Expand
An Investigation of Group Developed Weighing Matrices
Hollon, Je R. M.S., Department of Mathematics and Statistics, Wright State University, 2010. An Investigation of Group Developed Weighing Matrices. A weighing matrix is a square matrix whose entriesExpand
Multilevel Hadamard Matrices
Parker, Keli Siqueiros. M.S., Department of Mathematics and Statistics, Wright State University, 2011. Multilevel Hadamard Matrices. Multilevel Hadamard Matrices (MHMs) have been examined by Trihn,Expand
Group developed weighing matrices
The question of existence for 318 weighing matrices of order and weight both below 100 is answered, and some of the new results provide insight into the existence of matrices with larger weights and orders. Expand
On crystal sets
It is shown that several infinite families of 2-crystal sets and protocrystal sets in which every difference between distinct elements occurs zero or an even number of times exist and three nonexistence theorems for infinite families are given. Expand
Sequences and arrays with desirable correlation properties
  • K. Arasu
  • Computer Science
  • Information Security, Coding Theory and Related Combinatorics
  • 2011
This paper surveys several related areas that pertain to sequences and arrays with good correlation properties that have many applications in spread spectrum communication systems such as a code division multiple access (CDMA) system and Signal designs for CDMA systems. Expand


New circulant weighing matrices of prime order in CW(31,16), CW(71,25), CW(127,64)
Abstract Adapting the P. Eades conjecture about the existence of a multiplier for every (v,k,μ)-design to the more specific circulant weighing matrices in CW(p,s2) for a prime number p, we are ableExpand
Weighing Matrices and String Sorting
In this paper we establish a fundamental link between the search for weighing matrices constructed from two circulants and the operation of sorting strings, an operation that has been studiedExpand
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function – a review
Abstract The book, Orthogonal Designs : Quadratic Forms and Hadamard Matrices , Marcel Dekker, New York-Basel, 1979, by A.V. Geramita and Jennifer Seberry, has now been out of print for almost twoExpand
Circulant weighing matrices of weight 22t
A complete computer search is made for all circulant weighing matrices of order 16 such that MMT = kIn for some positive integer t and new structural results are obtained. Expand
Some results on weighing matrices
It is shown that if q is a prime power then there exists a circulant weighing matrix of order q 2 + q + 1 with q 2 nonzero elements per row and column. This result allows the bound N to be lowered inExpand
Orthogonal (0,1,-1) matrices
We study the conjecture: There exists a square (0,l,-l)-matrix W = W(w,k) of order w satisfying WWT= kIw for all k = 0, 1,..., w when w = 0 (mod 4). We prove the conjecture is true for 4, 8, 12, 16,Expand
A Theory of Ternary Complementary Pairs
The basic theory of ternary complementary pairs is redeveloped, showing how to construct all known pairs from a handful of initial pairs the authors call primitive, and all primitive pairs up to length 14 are displayed, more than doubling the number that could be inferred from the existing literature. Expand
Further explorations into ternary complementary pairs
This paper investigates patterns among those lengths and weights that are within easy computational distance from the last length considered therein, length 14, and provides support for the previous conjectures, and shed enough new light to speculate further as to the likely ultimate shape of the theory. Expand
The Solution of the Waterloo Problem
The investigation of symmetric designs is of central interest in design theory. Another class of important incidence structures are projective and affine geometries. A projective geometry gives riseExpand
Perfect ternary arrays
Four synthesizing methods for perfect ternary arrays are presented and new strong conditions for the existence of perfect arrays are developed, which can be used as starting arrays to construct additional perfect terNary sequences and arrays. Expand