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

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

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

NATURVETENSKAP  -- Fysik -- Fusion, plasma och rymdfysik (hsv//swe)

NATURAL SCIENCES  -- Physical Sciences -- Fusion, Plasma and Space Physics (hsv//eng)

Publikations- och innehållstyp

kon (ämneskategori)

ref (ämneskategori)