| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10224115 | Journal of Complexity | 2018 | 10 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
Domingo Gómez-Pérez, Min Sha, Andrew Tirkel,