Complexity of prime-dimensional sequences over a finite field

DOI10.1007/S11853-008-0024-1MaRDI QIDQ1035299zbMATH OpenOpenAlexFDO

Authors Eh. Yu. Lerner

Publication date 2 November 2009

Published in Functional Analysis and Other Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0710.3451

zbMATH Keywords

Arnold's conjecturecomplex sequencescyclic group algebrafinite fieldGauss summultiplicative function

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Other character sums and Gauss sums (11T24)

Abstract: V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a finite field, whose dimension $n$ is a prime number. We prove that with $noinfty$ this property is inherent in almost all sequences, while the values of multiplicative functions possess this property with any $n$ different from the characteristic of the field. We also describe the prime values of the parameter $n$ which make the logarithmic function almost most complicated. All these sequences reveal a stronger complexity; its algebraic sense is quite clear.

Recommendations

• A complexity measure for families of binary sequences
• On the complexity of finite sequences over a finite set
• On the linear complexity for multidimensional sequences
• scientific article; zbMATH DE number 2051150
• Linear Complexity Over<tex>$F_p$</tex>of Sidel'nikov Sequences

Cites work

• Complexity of finite sequences of zeros and ones and geometry of finite spaces of functions
• Graphs of difference operators for p-ary sequences
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• On examples of difference operators for \(\{0,1\}\)-valued functions over finite sets

Cited in

(1)

• Graphs of difference operators for p-ary sequences

This page was built for publication: Complexity of prime-dimensional sequences over a finite field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1035299)