dc.contributor.author | Georgiou, S | en |
dc.contributor.author | Koukouvinos, C | en |
dc.date.accessioned | 2014-03-01T01:16:50Z | |
dc.date.available | 2014-03-01T01:16:50Z | |
dc.date.issued | 2001 | en |
dc.identifier.issn | 0097-3165 | en |
dc.identifier.uri | https://dspace.lib.ntua.gr/xmlui/handle/123456789/14248 | |
dc.subject | Directed sequences | en |
dc.subject | multiplication | en |
dc.subject | autocorrelation | en |
dc.subject | orthogonal design | en |
dc.subject.classification | Mathematics | en |
dc.subject.other | MATRICES | en |
dc.title | On Sequences with Zero Autocorrelation and Orthogonal Designs | en |
heal.type | journalArticle | en |
heal.identifier.primary | 10.1006/jcta.2000.3120 | en |
heal.identifier.secondary | http://dx.doi.org/10.1006/jcta.2000.3120 | en |
heal.language | English | en |
heal.publicationDate | 2001 | en |
heal.abstract | 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. (C) 2001 Academic Press. | en |
heal.publisher | ACADEMIC PRESS INC | en |
heal.journalName | Journal of Combinatorial Theory. Series A | en |
dc.identifier.doi | 10.1006/jcta.2000.3120 | en |
dc.identifier.isi | ISI:000167937600002 | en |
dc.identifier.volume | 94 | en |
dc.identifier.issue | 1 | en |
dc.identifier.spage | 15 | en |
dc.identifier.epage | 33 | en |
Αρχεία | Μέγεθος | Μορφότυπο | Προβολή |
---|---|---|---|
Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο. |