𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Sequences with Zero Autocorrelation and Orthogonal Designs

✍ Scribed by S. Georgiou; C. Koukouvinos


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
145 KB
Volume
94
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis


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 type (2n+1, 2n+1) with zero NPAF as well as normal sequences of length n in order to construct four directed sequences of length 2n and type (2n, 2n, 2n, 2n) with zero NPAF. We construct two and four directed sequences with zero PAF of length 34 and type (34, 34), and (34, 34, 34, 34), respectively, as well as four directed sequences with zero NPAF of lengths 34, 34, 33, 33 and type (67, 67). We also indicate that from m directed sequences of lengths n 1 , n 2 , ..., n m which consist of t variables, we obtain k } m directed sequences of lengths n 1 , n 2 , ..., n m (k sequences will be of lengths n i , i=1, 2, ..., m) which consist of k } t variables for k=1, 2, .... The above methods lead to the construction of many new orthogonal designs.


πŸ“œ SIMILAR VOLUMES


Base sequences, complementary ternary se
✍ Dragomir Ε½. DokoviΔ‡ πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 535 KB

We construct several new families of orthogonal designs related to one of the weighing matrix conjectures. We also construct some new complementary quadruples (A; B; C; D ) of (0, fi}sequences of length n and total weight w, denoted as CTQ(n, w). The word complementary refers to the fact that the su

On the amicability of orthogonal designs
✍ W. H. Holzmann; H. Kharaghani πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 134 KB

## 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 variab

Designs with mutually orthogonal resolut
✍ E. R. Lamken πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 298 KB

## Abstract Two resolutions __R__ and __R__^β€²^ of a combinatorial design are called orthogonal if |__R__~__i__~∩__R__|≀1 for all __R__~__i__~∈__R__ and __R__∈__R__^β€²^. A set __Q__={__R__^1^, __R__^2^, …, __R__^__d__^} of __d__ resolutions of a combinatorial design is called a set of mutually orthog