Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s00200-019-00393-z | Applicable Algebra in Engineering, Communication and Computing |
Keywords | Field | DocType |
Linear complexity, Multidimensional linear complexity, Periodic arrays, Multidimensional arrays, Multisequences, Gröbner bases | Discrete mathematics,Information security,Theoretical computer science,Linear complexity,Periodic graph (geometry),Mathematics | Journal |
Volume | Issue | ISSN |
31 | 1 | 0938-1279 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael A. Arce-Nazario | 1 | 13 | 5.18 |
| Francis Castro | 2 | 0 | 0.34 |
| Domingo Gomez-perez | 3 | 61 | 10.22 |
| Oscar Moreno | 4 | 0 | 0.34 |
| José Ortiz-Ubarri | 5 | 0 | 0.34 |
| Ivelisse Rubio | 6 | 0 | 0.34 |
| Andrew Z. Tirkel | 7 | 255 | 269.21 |