On sequences with zero autocorrelation

Koukouvinos, C; Kounias, S; Seberry, J; Yang, CH; Yang, J

dc.contributor.author	Koukouvinos, C	en
dc.contributor.author	Kounias, S	en
dc.contributor.author	Seberry, J	en
dc.contributor.author	Yang, CH	en
dc.contributor.author	Yang, J	en
dc.date.accessioned	2014-03-01T01:10:00Z
dc.date.available	2014-03-01T01:10:00Z
dc.date.issued	1994	en
dc.identifier.issn	09251022	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/11287
dc.subject	Exhaustive Search	en
dc.title	On sequences with zero autocorrelation	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/BF01388649	en
heal.identifier.secondary	http://dx.doi.org/10.1007/BF01388649	en
heal.publicationDate	1994	en
heal.abstract	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.	en
heal.publisher	Kluwer Academic Publishers	en
heal.journalName	Designs, Codes and Cryptography	en
dc.identifier.doi	10.1007/BF01388649	en
dc.identifier.volume	4	en
dc.identifier.issue	3	en
dc.identifier.spage	327	en
dc.identifier.epage	340	en