Please use this identifier to cite or link to this item:
https://doi.org/10.1109/18.669398
| Title: | On the linear complexity of Legendre sequences | Authors: | Ding, C. Helleseth, T. Shan, W. |
Keywords: | Codes Cryptography Legendre sequence Sequence |
Issue Date: | 1998 | Citation: | Ding, C., Helleseth, T., Shan, W. (1998). On the linear complexity of Legendre sequences. IEEE Transactions on Information Theory 44 (3) : 1276-1278. ScholarBank@NUS Repository. https://doi.org/10.1109/18.669398 | Abstract: | In this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint. © 1998 IEEE. | Source Title: | IEEE Transactions on Information Theory | URI: | http://scholarbank.nus.edu.sg/handle/10635/99364 | ISSN: | 00189448 | DOI: | 10.1109/18.669398 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
SCOPUSTM
Citations
161
checked on Jun 8, 2023
WEB OF SCIENCETM
Citations
120
checked on Jun 8, 2023
Page view(s)
216
checked on Jun 8, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.