Meidl, Wilfried and Brandstaetter, Nina (2008) On the linear complexity of Sidel'nikov Sequences over nonprime fields. (Accepted/In Press)
There is a more recent version of this item available.
![[thumbnail of NinaMeidl_2.pdf]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
PDF
NinaMeidl_2.pdf
Download (199kB)
Abstract
We introduce a generalization of Sidel'nikov sequences for arbitrary
finite fields. We show that several classes of Sidel'nikov sequences
over arbitrary finite fields exhibit a large linear complexity. For
Sidel'nikov sequences over $\F_8$ we provide exact values for their
linear complexity.
| Item Type: | Article |
|---|---|
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Wilfried Meidl |
| Date Deposited: | 07 Nov 2008 17:10 |
| Last Modified: | 19 Jul 2019 14:34 |
| URI: | https://research.sabanciuniv.edu/id/eprint/9793 |
Available Versions of this Item
-
On the linear complexity of Sidel'nikov Sequences over nonprime fields. (deposited 04 Jun 2008 09:56)
- On the linear complexity of Sidel'nikov Sequences over nonprime fields. (deposited 07 Nov 2008 17:10) [Currently Displayed]
Actions (login required)
- View Item