New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function – a review

@article{Koukouvinos1999NewWM,
  title={New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function – a review},
  author={C. Koukouvinos and J. Seberry},
  journal={Journal of Statistical Planning and Inference},
  year={1999},
  volume={81},
  pages={153-182}
}
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 two decades. Many of the results on weighing matrices presented therein have been greatly improved. Here we review the theory, restate some results which are no longer available and expand on the existence of many new weighing matrices and orthogonal designs of order 2 n where n is odd. We give a number… Expand
New classes of orthogonal designs and weighing matrices derived from near normal sequences
TLDR
It is shown that near normal sequences of length n = 4m + 1 can be used to construct four directed sequences of lengths 2m+1, 2m-1,2m, 2 m and type (n, n) with zero NPAF, which leads to the construction of many large orthogonal designs. Expand
Further results on ternary complementary sequences, orthogonal designs and weighing matrices
A set of sequences is complementary, if the sum of their periodic or nonperiodic autocorrelation function is zero. Infinite families of orthogonal designs, based on some weighing matrices of orderExpand
New orthogonal designs from weighing matrices
TLDR
It is demonstrated that some of these new orthogonal designs, the ones that are full, can be used to construct inequivalent Hadamard matrices. Expand
New Infinite Classes of Orthogonal Designs
In this paper we use some results on weighing matrices W (2 n ,9) constructed using two circulants to obtain infinite classes of orthogonal designs. We also present a method that is used to constructExpand
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
A modified power spectral density test applied to weighing matrices with small weight
TLDR
A modified power spectral density test is established that is applied to the search for weighing matrices of small weights constructed from two circulants to define the Discrete Fourier Transform on the support of the first rows of the twocirculants, thus exploiting the inherent sparsity of the problem. Expand
An efficient string sorting algorithm for weighing matrices of small weight
In this paper, we demonstrate that the search for weighing matrices of small weights constructed from two circulants can be viewed as a string sorting problem together with a linear time algorithm toExpand
NEW INFINITE CLASSES OF WEIGHING MATRICES
SUMMARY. In this paper we use a new algorithm to find weighing matrices W(2n;9) constructed using two circulant matrices. The basic idea of this algorithm is to investigate all possible ways theExpand
When the necessary conditions are not sufficient: sequences with zero autocorrelation function
Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification of Circulant Weighing Matrices of Weight 9, Bar-Ilan University, Ramat-Gan, 1997, haveExpand
New classes of orthogonal designs constructed from complementary sequences with given spread
In this paper we present, infinite families of new orthgonal designs, based on some weighing matrices of order 2n, weight 2n k and spread o, constructed from two circlante and directed sequences.Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 64 REFERENCES
Hadamard matrices, Sequences, and Block Designs
One hundred years ago, in 1893, Jacques Hadamard [31] found square matrices of orders 12 and 20, with entries ±1, which had all their rows (and columns) pairwise orthogonal. These matrices, X =Expand
When the necessary conditions are not sufficient: sequences with zero autocorrelation function
Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification of Circulant Weighing Matrices of Weight 9, Bar-Ilan University, Ramat-Gan, 1997, haveExpand
Circulant weighing designs
Algebraic techniques are employed to obtain necessary conditions for the existence of certain families of circulant weighing designs. As an application we rule out the existence of many circulantExpand
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
On the existence of orthogonal designs
An orthogonal design of type (s^, s ^ , s^) and order n on the comniuting variables x , x , x , is an n n matrix A with entries -L ^ Z't from {o, ir^, such that = V 2 ) S .X . ^=l I . The existenceExpand
Orthogonal Designs IV: Existence Questions
In [5] Raghavarao showed that if n = 2 (mod 4) and A is a {O, 1, -1} matrix satisfying AAt = (n 1) In. then n 1 = a2 b2 for a, b integers. In [4] van Lint and Seidel giving a proof modeled on a proofExpand
New Hadamard matrices and conference matrices obtained via Mathon's construction
TLDR
A formulation, via (1, −1) matrices, of Mathon's construction for conference matrices is given and a new family ofconference matrices of order 5⋅92t+1 + 1,t ≥ 0 is derived. Expand
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
Multiplications of ternary complementary pairs
TLDR
This paper presents a computer-search method for concatenating or "multiplying" binary or ternary complementary pairs, and some applications and numerical consequences are shown. Expand
Contemporary design theory : a collection of surveys
Orthogonal Factorizations of Graphs (B. Alspach, et al.). Conjugate--Orthogonal Latin Squares and Related Structures (F. Bennett & L. Zhu). Directed and Mendelsohn Triple Systems (C. Colbourn & A.Expand
...
1
2
3
4
5
...