New construction for binary sequences of period p/sup m/-1 with optimal autocorrelation using (z+1)/sup d/+az/sup d/+b
| Autor: | Habong Chung, Tor Helleseth, Jong-Seon No, Hong-Yeop Song, Kyeongcheol Yang, Jung-Do Lee |
|---|---|
| Rok vydání: | 2001 |
| Předmět: |
Discrete mathematics
Polynomial Period (periodic table) Autocorrelation Binary number Library and Information Sciences Prime (order theory) Computer Science Applications Combinatorics Distribution (mathematics) TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Correlation method Computer search Information Systems Mathematics |
| Zdroj: | IEEE Transactions on Information Theory. 47:1638-1644 |
| ISSN: | 0018-9448 |
| Popis: | We present a construction for binary sequences {s(t)} of period N=p/sup m/-1 for an odd prime p based on the polynomial (z+1)/sup d/+az/sup d/+b, and discuss them in some cases of parameters p, m, d, a, and b. We show that new sequences from our construction are balanced or almost balanced and have optimal three-level autocorrelation for the case when the polynomial (z+1)/sup d/+z/sup d/+a can be transformed into the form z/sup 2/-c. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of those sequences are presented. For the cases when the polynomial (z+1)/sup d/+z/sup d/+a cannot be transformed into the form z/sup 2/-c, we performed extensive computer search, and results are summarized. Based on these results, some open problems are formulated. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|