On the linear complexity for multidimensional sequences
classification
🧮 math.NT
cs.ITmath.IT
keywords
complexitylinearmultidimensionalsequencesboundscasedefineerror
read the original abstract
In this paper, we define the linear complexity for multidimensional sequences over finite fields, generalizing the one-dimensional case. We give some lower and upper bounds, valid with large probability, for the linear complexity and $k$-error linear complexity of multidimensional periodic sequences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.