zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
On sequences with zero autocorrelation. (English) Zbl 0808.05021

Summary: 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 2n-1,2n-1,n,n are constructed for all decompositions of 6n-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.


MSC:
05B20Matrices (incidence, Hadamard, etc.)
68R05Combinatorics in connection with computer science
62H20Statistical measures of associations
References:
[1]Cohen, G., Rubie, D., Seberry, J., Koukouvinos, C., Kounias, S., and Yamada, M. 1989. A survey of base sequences, disjoint complementary sequences andO D(4t; t, t, t, t).J. Combin. Math. Combin. Comput. 5:69-104.
[2]Cooper, J. and Wallis, J. 1972. A construction for Hadamard arrays.Bull. Austr. Math. Soc. 7:269-277. · Zbl 0247.05011 · doi:10.1017/S0004972700045019
[3]Edmondson, G. M. 1991.More Non-existent Turyn Sequences. Masters Thesis, University College, University of NSW, Australian Defence Force Academy, Canberra.
[4]Edmondson, G. M., Seberry, J., and Anderson, M. R. 1994. On the existence of Turyn sequences of length less than 43.Math. Comput. 62:351-362.
[5]Eliahou, S., Kervaire, M., and Saffari, B. 1990. A new restriction on the lengths of Golay complementary sequences.J. Combin. Th. (Ser. A) 55:49-59. · Zbl 0705.94012 · doi:10.1016/0097-3165(90)90046-Y
[6]Geramita, A. V., and Seberry, J. 1979.Orthogonal Designs: Quadratic Forms and Hadamard Matrices. New York: Marcel Dekker.
[7]Golay, M. J. E. 1961. Complementary series.IRE Trans. Information Theory IT-7:82-87. · doi:10.1109/TIT.1961.1057620
[8]Golay, M. J. E. 1962. Note on Complementary series.Proc. of the IRE 84.
[9]Gysin, M. 1993.On Normal and Near-Yang Sequences. M.Sc. Thesis, University of Wollongong.
[10]Gysin, M., and Seberry, J. In press. New results with near-Yang sequences.Bull. Institute of Comb. Appl.
[11]Harwit, M., and Sloane, N. J. A. 1979.Hadamard Transform Optics. New York: Academic Press.
[12]Koukouvinos, C., Kounias, S., and Seberry, J. 1990a. Further results on base sequences, disjoint complementary sequences,O D(4t; t, t, t, t) and the excess of Hadamard matrices.Ars Combinatoria 30:241-256.
[13]Koukouvinos, C., Kounias, S., and Sotirakoglou, K. 1990b. On base and Turyn sequences.Mathematics of Computation 55:825-837. · doi:10.1090/S0025-5718-1990-1023764-7
[14]Kounias, S., Koukouvinos, C., and Sotirakoglou, K. 1991. On Golay sequences.Discrete Mathematics 92:177-185. · Zbl 0739.05002 · doi:10.1016/0012-365X(91)90279-B
[15]Koukouvinos, C., and Seberry, J. 1992. Constructing Hadamard matrices from orthogonal designs.Austral. J. Comb. 6:267-278.
[16]Seberry, J., and Yamada, M. 1992. Hadamard matrices, sequences, and block designs. In D. J. Stinson and J. Dinitz, editors,Contemporary Design Theory?A Collection of Surveys, pp. 431-560. John Wiley and Sons.
[17]Seberry Wallis, J. 1975. Construction of Williamson type matrices.J. Linear and Multilinear Algebra 3:197-207. · Zbl 0321.05021 · doi:10.1080/03081087508817111
[18]Turyn, R. J. 1974. Hadamard matrices, Baumert-Hall units, four symbol sequences, pulse compressions and surface wave encodings.J. Combin. Theory (Ser. A) 16:313-333. · Zbl 0291.05016 · doi:10.1016/0097-3165(74)90056-9
[19]Yang, C. H. 1979. Hadamard matrices, finite sequences and polynomials defined on the unit circle.Math. Comput. 33:688-693. · doi:10.1090/S0025-5718-1979-0525685-8
[20]Yang, C. H. 1982. Hadamard matrices and ?-codes of length 3n.Proc. Amer. Math. Soc. 85:480-482.
[21]Yang, C. H. 1983a. Lagrange identity for polynomials and ?-codes of lengths 7t and 13t.Proc. Amer. Math. Soc. 88:746-750.
[22]Yang, C. H. 1983b. A composition theorem for ?-codes.Proc. Amer. Math. Soc. 89:375-378.
[23]Yang, C. H. 1989. On composition of four-symbol ?-codes and Hadamard matrices.Proc. Amer. Math. Soc. 107:763-776.