Searching. Please wait…
1582
37
171
29406
4423
2606
347
392
Abstract: The linear complexity of a sequence is an important parameter for many applications, especially those related to information security, and hardware implementation. It is desirable to develop a corresponding measure and theory for multidimensional arrays that are consistent with those of sequences. In this paper we use Gröbner bases to develop a theory for analyzing the multidimensional linear complexity of general periodic arrays. We also analyze arrays constructed using the method of composition and establish tight bounds for their multidimensional linear complexity.
Fuente: Applicable Algebra in Engineering, Communication and Computing, 2020, 31(1), 43-63
Publisher: Springer Verlag
Year of publication: 2020
No. of pages: 21
Publication type: Article
DOI: 10.1007/s00200-019-00393-z
ISSN: 0938-1279,1432-0622
Spanish project: MTM2014-55421-P
Publication Url: https://doi.org/10.1007/s00200-019-00393-z
SCOPUS
Citations
Google Scholar
Metrics
Read publication
ARCE-NAZARIO, RAFAEL
CASTRO, FRANCIS
DOMINGO GOMEZ PEREZ
MORENO, OSCAR
ORTIZ-UBARRI, JOSÉ
RUBIO, IVELISSE
TIRKEL, ANDREW
Back