Linear complexity profile of sequences over the field GF(Q)
(1988) IEEE International Symposium on Information Theory (ISIT), 1988 p.217-217- Abstract
Summary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences Sn of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear complexity profile for investigating the randomness of sequences over GF(q). Finally, the author investigates how useful these criteria are by comparing the results with other randomness tests.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/61e62b32-d26c-4035-a1f9-c7a276498a11
- author
- Smeets, Ben LU
- organization
- publishing date
- 1988
- type
- Contribution to conference
- publication status
- published
- subject
- pages
- 1 pages
- conference name
- IEEE International Symposium on Information Theory (ISIT), 1988
- conference location
- Kobe, Japan
- conference dates
- 1988-06-19 - 1988-06-24
- external identifiers
-
- scopus:0024122278
- DOI
- 10.1109/ISIT.1988.22303
- language
- English
- LU publication?
- yes
- id
- 61e62b32-d26c-4035-a1f9-c7a276498a11
- date added to LUP
- 2021-11-05 02:29:40
- date last changed
- 2024-01-05 19:58:28
@misc{61e62b32-d26c-4035-a1f9-c7a276498a11, abstract = {{<p>Summary form only given. The author extends Reuppel's concept of the linear complexity profile of binary sequences to sequences over an arbitrary finite field and provides formulas for the expected linear complexity and its variance of sequences S<sup>n</sup> of length n over GF(q). He shows that the variance approaches 1/q when q approaches ∞. He presents criteria that could be useful when using the linear complexity profile for investigating the randomness of sequences over GF(q). Finally, the author investigates how useful these criteria are by comparing the results with other randomness tests.</p>}}, author = {{Smeets, Ben}}, language = {{eng}}, pages = {{217--217}}, title = {{Linear complexity profile of sequences over the field GF(Q)}}, url = {{http://dx.doi.org/10.1109/ISIT.1988.22303}}, doi = {{10.1109/ISIT.1988.22303}}, year = {{1988}}, }