| Authors: | Kolokotronis N., Rizomiliotis P., Kalouptsidis N. |
|---|
| Title: | First-order optimal approximation of binary sequences |
|---|
| Conference: | 2001 Conference on Sequences and Their Applications |
|---|
| Editors: | T. Helleseth, P. V. Kumar, and K. Yang |
|---|
| Ed: | No |
|---|
| Eds: | Yes |
|---|
| Pages: | 242-256 |
|---|
| To appear: | No |
|---|
| Month: | May |
|---|
| Year: | 2001 |
|---|
| Place: | Bergen, Norway |
|---|
| Pubisher: | Series in Discrete Mathematics and Theoretical Computer Science, Springer |
|---|
| Link: | |
|---|
| File name: | |
|---|
| Abstract: | A new family of balanced sequences over
Fp, p odd prime, with the optimal correlation property
is presented. The construction is based on p-ary
Helleseth-Gong sequences with ideal autocorrelation.
The family contains pn balanced sequences of period
p2n−1. The correlation spectrum peak nontrivial value
does not exceed 1 + pn, i.e. it is optimal in terms
of Welch’s lower bound. The linear span of the sequences
is 2n( n
k + 2), where k is a divisor of n such
that n/k is odd. |
|---|
Greek