Please use this identifier to cite or link to this item:
https://doi.org/10.1007/s00605-005-0392-2
DC Field | Value | |
---|---|---|
dc.title | The asymptotic behavior of the joint linear complexity profile of multisequences | |
dc.contributor.author | Niederreiter, H. | |
dc.contributor.author | Wang, L.-P. | |
dc.date.accessioned | 2014-10-28T02:47:02Z | |
dc.date.available | 2014-10-28T02:47:02Z | |
dc.date.issued | 2007-02 | |
dc.identifier.citation | Niederreiter, H., Wang, L.-P. (2007-02). The asymptotic behavior of the joint linear complexity profile of multisequences. Monatshefte fur Mathematik 150 (2) : 141-155. ScholarBank@NUS Repository. https://doi.org/10.1007/s00605-005-0392-2 | |
dc.identifier.issn | 00269255 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/104253 | |
dc.description.abstract | We prove a conjecture on the asymptotic behavior of the joint linear complexity profile of random multisequences over a finite field. This conjecture was previously shown only in the special cases of single sequences and pairs of sequences. We also establish an asymptotic formula for the expected value of the nth joint linear complexity of random multisequences over a finite field. Some more precise results are shown for triples of sequences. © Springer-Verlag 2007. | |
dc.description.uri | http://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s00605-005-0392-2 | |
dc.source | Scopus | |
dc.subject | Joint linear complexity | |
dc.subject | Joint linear complexity profile | |
dc.subject | Multisequences | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.doi | 10.1007/s00605-005-0392-2 | |
dc.description.sourcetitle | Monatshefte fur Mathematik | |
dc.description.volume | 150 | |
dc.description.issue | 2 | |
dc.description.page | 141-155 | |
dc.identifier.isiut | 000243632400004 | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.