Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/43016
DC Field | Value | |
---|---|---|
dc.title | Constructions of sequences with almost perfect linear complexity profile from curves over finite fields | |
dc.contributor.author | Xing, C. | |
dc.contributor.author | Niederreiter, H. | |
dc.contributor.author | Lam, K.Y. | |
dc.contributor.author | Ding, C. | |
dc.date.accessioned | 2013-07-23T09:22:43Z | |
dc.date.available | 2013-07-23T09:22:43Z | |
dc.date.issued | 1999 | |
dc.identifier.citation | Xing, C.,Niederreiter, H.,Lam, K.Y.,Ding, C. (1999). Constructions of sequences with almost perfect linear complexity profile from curves over finite fields. Finite Fields and their Applications 5 (3) : 301-313. ScholarBank@NUS Repository. | |
dc.identifier.issn | 10715797 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/43016 | |
dc.description.abstract | Sequences with almost perfect linear complexity profile are of importance for the linear complexity theory of sequences. In this paper we present several constructions of sequences with almost perfect linear complexity profile based on algebraic curves over finite fields. Moreover, some interesting consequences and examples are derived from our constructions. © 1999 Academic Press. | |
dc.source | Scopus | |
dc.subject | Algebraic curves over finite fields | |
dc.subject | Linear complexity | |
dc.subject | Sequences | |
dc.type | Article | |
dc.contributor.department | COMPUTER SCIENCE | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | Finite Fields and their Applications | |
dc.description.volume | 5 | |
dc.description.issue | 3 | |
dc.description.page | 301-313 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.