On the amicability of orthogonal designs
β Scribed by W. H. Holzmann; H. Kharaghani
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 134 KB
- Volume
- 17
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Although it is known that the maximum number of variables in two amicable orthogonal designs of order 2^n^p, where p is an odd integer, never exceeds 2__n__+2, not much is known about the existence of amicable orthogonal designs lacking zero entries that have 2__n__+2 variables in total. In this paper we develop two methods to construct amicable orthogonal designs of order 2^n^p where p odd, with no zero entries and with the total number of variables equal or nearly equal to 2__n__+2. In doing so, we make a surprising connection between the two concepts of amicable sets of matrices and an amicable pair of matrices. With the recent discovery of a link between the theory of amicable orthogonal designs and spaceβtime codes, this paper may have applications in spaceβtime codes. Β© 2009 Wiley Periodicals, Inc. J Combin Designs 17: 240β252, 2009
π SIMILAR VOLUMES
We propose some methods for multiplying the length and type of sequences with elements on a set of commuting variables which have zero non-periodic autocorrelation function. We use base sequences of lengths n+1, n+1, n, n in order to construct four directed sequences of lengths n+1, n+1, n, n and ty
## Abstract Amicable sets of eight matrices are very useful in the construction of orthogonal designs using the Kharaghani array. In this article we use a simple procedure to construct many new amicable sets of eight matrices of order 7 and then new orthogonal designs of order 56. Some of these are
## Abstract Symmetric designs and Hadamard matrices are used to construct binary and ternary selfβdual codes. Orthogonal designs are shown to be useful in construction of selfβdual codes over large fields. In this paper, we first introduce a new array of order 12, which is suitable for any set of f
## Abstract For the existence problem of __OGDDs__ of type __g^u^__, Colbourn and Gibbons settled it with few possible exceptions for each group size __g__. In this article, we will completely settle it for __g__ββ€β6. Β© 2006 Wiley Periodicals, Inc. J Combin Designs