Linear complexity profile of sequences over the field GF(Q)

Ben Smeets

doi:10.1109/ISIT.1988.22303

Linear complexity profile of sequences over the field GF(Q)

Ben Smeets

Lund University

Research output: Contribution to conference › Paper, not in proceeding › peer-review

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 Sⁿ 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.

Original language	English
Pages	217
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1988.22303
Publication status	Published - 1988
Event	IEEE International Symposium on Information Theory (ISIT), 1988 - Kobe, Japan Duration: 1988 Jun 19 → 1988 Jun 24

Conference

Conference	IEEE International Symposium on Information Theory (ISIT), 1988
Country/Territory	Japan
City	Kobe
Period	1988/06/19 → 1988/06/24

Subject classification (UKÄ)

Computer Science
Fusion, Plasma and Space Physics

Access to Document

10.1109/ISIT.1988.22303

Cite this

@conference{61e62b32d26c4035a1f9c7a276498a11,

title = "Linear complexity profile of sequences over the field GF(Q)",

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.",

author = "Ben Smeets",

year = "1988",

doi = "10.1109/ISIT.1988.22303",

language = "English",

pages = "217",

note = "IEEE International Symposium on Information Theory (ISIT), 1988 ; Conference date: 19-06-1988 Through 24-06-1988",

}

TY - CONF

T1 - Linear complexity profile of sequences over the field GF(Q)

AU - Smeets, Ben

PY - 1988

Y1 - 1988

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.1988.22303

DO - 10.1109/ISIT.1988.22303

M3 - Paper, not in proceeding

AN - SCOPUS:0024122278

SP - 217

T2 - IEEE International Symposium on Information Theory (ISIT), 1988

Y2 - 19 June 1988 through 24 June 1988

ER -

Linear complexity profile of sequences over the field GF(Q)

Abstract

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this