Papers
Topics
Authors
Recent
Search
2000 character limit reached

Turyn-type sequences: Classification, Enumeration and Construction

Published 19 Jun 2012 in math.CO | (1206.4107v1)

Abstract: Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B and twice that of C,D is a delta-function (i.e., vanishes everywhere except at 0). Turyn-type sequences TT(n) are known to exist for all even n not larger than 36. We introduce a definition of equivalence to construct a canonical form for TT(n) in general. By using this canonical form, we enumerate the equivalence classes of TT(n) for n up to and including 32. We also construct the first example of Turyn-type sequences TT(38).

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.