| dc.contributor.author |
Koukouvinos, C |
en |
| dc.contributor.author |
Kounias, S |
en |
| dc.contributor.author |
Sotirakoglou, K |
en |
| dc.date.accessioned |
2014-06-06T06:41:53Z |
|
| dc.date.available |
2014-06-06T06:41:53Z |
|
| dc.date.issued |
1990 |
en |
| dc.identifier.uri |
http://dx.doi.org/10.1090/S0025-5718-1990-1023764-7 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/313 |
|
| dc.subject |
Cross Correlation |
en |
| dc.subject |
Exhaustive Search |
en |
| dc.subject |
Polynomial Algorithm |
en |
| dc.title |
On base and Turyn sequences |
en |
| heal.type |
journalArticle |
en |
| heal.identifier.primary |
10.1090/S0025-5718-1990-1023764-7 |
en |
| heal.publicationDate |
1990 |
en |
| heal.abstract |
Base sequences of lengths n + 1 , n + 1 , n, n are constructed for all decompositions of 4n + 2 into four squares for n = 19, ldots ,24 . The construction is achieved through an algorithm which is also presented. It is proved through an exhaustive search that Turyn sequences do not exist for n = |
en |
| heal.journalName |
Mathematics of Computation |
en |
| dc.identifier.doi |
10.1090/S0025-5718-1990-1023764-7 |
en |