z-logo
open-access-imgOpen Access
On sequences with zero autocorrelation
Author(s) -
Christos Koukouvinos,
Stratis Kounias,
Jennifer Seberry,
C. H. Yang,
Jian Yang
Publication year - 1994
Publication title -
designs codes and cryptography
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.898
H-Index - 61
eISSN - 1573-7586
pISSN - 0925-1022
DOI - 10.1007/bf01388649
Subject(s) - mathematics , hadamard transform , autocorrelation , combinatorics , base (topology) , zero (linguistics) , complementary sequences , algorithm , mathematical analysis , statistics , philosophy , linguistics
Normal sequences of lengths n=18, 19 are constructed. It is proved through an exhaustive search that normal sequences do not exist for n=17, 21, 22, 23. Marc Gysin has shown that normal sequences do not exist for n=24. So the first unsettled case is n=27. Base sequences of lengths 2 n-1, 2 n-1, n, n are constructed for all decompositions of 6 n-2 into four squares for n=2, 4, 6, ..., 20 and some base sequences for n=22, 24 are also given. So T-sequences (T-matrices) of length 71 are constructed here for the first time. This gives new Hadamard matrices of orders 213, 781, 1349, 1491, 1633, 2059, 2627, 2769, 3479, 3763, 4331, 4899, 5467, 5609, 5893, 6177, 6461, 6603, 6887, 7739, 8023, 8591, 9159, 9443, 9727, 9869. © 1994 Kluwer Academic Publishers

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom