On a class of almost perfect sequences (Q1360885): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Combinatorial Properties of Group Divisible Incomplete Block Designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4777304 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999066 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Automorphism Groups of Divisible Designs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar functions, relative difference sets, and character theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite geometry and character theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Existence and nonexistence of almost-perfect autocorrelation sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5723265 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Almost perfect autocorrelation sequences / rank | |||
Normal rank |
Revision as of 16:35, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a class of almost perfect sequences |
scientific article |
Statements
On a class of almost perfect sequences (English)
0 references
14 January 1998
0 references
An \(n\)-periodic sequence \((s_i)\) with entries \(\pm1\) is almost perfect if all but one of the sums \(\sum^{n-1}_{i=0} s_is_{i+1}\) (\(t\not\equiv 0\pmod n\)) are zero. Any almost perfect sequence is equivalent to a cyclic difference set in \(\mathbb{Z}_n\) of size \(k={n\over 2}-\theta\) and \(\lambda_1=\theta(\theta-1)\), \(\lambda_2={n\over 4}-\theta\). The paper proves some necessary conditions for the existence of such difference sets and sequences. In particular, it is shown that if \(\theta=2\), there are only 6 possible values for \(n\) in the range \(n\leq 20,000\).
0 references
almost perfect sequence
0 references
cyclic difference set
0 references