Linear complexity over F_p of Sidel'nikov sequences

T. Helleseth, M. Maas, J.E. Mathiassen, A.J.M. Segers

Research output: Contribution to journal › Article › Academic › peer-review

Original language	English
Pages (from-to)	2468-2472
Journal	IEEE Transactions on Information Theory
Volume	50
Issue number	10
DOIs	https://doi.org/10.1109/TIT.2004.834854
Publication status	Published - 2004

Access to Document

@article{aca7e2ad3a3840bf932023f04a681ec6,

title = "Linear complexity over F_p of Sidel'nikov sequences",

author = "T. Helleseth and M. Maas and J.E. Mathiassen and A.J.M. Segers",

year = "2004",

doi = "10.1109/TIT.2004.834854",

language = "English",

volume = "50",

pages = "2468--2472",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers",

number = "10",

}

TY - JOUR

T1 - Linear complexity over F_p of Sidel'nikov sequences

AU - Helleseth, T.

AU - Maas, M.

AU - Mathiassen, J.E.

AU - Segers, A.J.M.

PY - 2004

Y1 - 2004

U2 - 10.1109/TIT.2004.834854

DO - 10.1109/TIT.2004.834854

M3 - Article

SN - 0018-9448

VL - 50

SP - 2468

EP - 2472

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 10

ER -