New sequences with zero autocorrelation
The authors give a new construction method for unimodular delta-correlated sequences of length \(p\) (a prime). This method uses so-called Gauss periods. In the case \(p=3f+1\) it is shown that the elements are defined by roots of a polynomial of degree 12 over \(\mathbb{Z}\) (the integers) for one family and by roots of a polynomial of degree 6 for another family. For \(p=3,5,7\) and 13 the methods can be shown to generate all equivalence classes of unimodular delta-correlated sequences, where the equivalence is defined by a specific group of transformations. The authors conjecture that this is true for any prime \(p\).
- Unimodular Perfect Sequences of Length<tex>$p^s$</tex>
- New construction for binary sequences of period p/sup m/-1 with optimal autocorrelation using (z+1)/sup d/+az/sup d/+b
- Construction of infinite unimodular sequences with zero autocorrelation
- Prime-phase sequences with periodic correlation properties better than binary sequences
- Recent results on polyphase sequences
- Unimodular Perfect Sequences of Length<tex>$p^s$</tex>
- scientific article; zbMATH DE number 682555 (Why is no real title available?)
- On biunimodular vectors for unitary matrices
- Constructions and a generalization of perfect autocorrelation sequences on \(\mathbb{Z}\)
- New construction of perfect Gaussian integer sequence with period ${p^2}$
- Block-circulant complex Hadamard matrices
- Construction of infinite unimodular sequences with zero autocorrelation
This page was built for publication: New sequences with zero autocorrelation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812366)
