On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences |
| |
| Authors: | Gohar M Kyureghyan Alexander Pott |
| |
| Institution: | 1. Magdeburg, Faculty of Mathematics, Otto-von-Guencke-University, Postfach 4120, Magdeburg, Germany, 39016
|
| |
| Abstract: | In 6] and 10], a construction of binary sequences with an (almost) optimal autocorrelation spectrum is suggested. We continue the study of the linear complexity and the linear feedback polynomial of these sequences over $ \mathbb{F} $ 2, originated in 4]. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
