Multidimensional linear complexity analysis of periodic arrays
DOI10.1007/s00200-019-00393-zzbMath1455.94096OpenAlexW2955338127WikidataQ114692911 ScholiaQ114692911MaRDI QIDQ2304655
Domingo Gómez-Pérez, José Ortiz-Ubarri, Andrew Tirkel, R. Arce-Nazario, Oscar Moreno, Ivelisse M. Rubio, Francis N. Castro
Publication date: 13 March 2020
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-019-00393-z
Gröbner baseslinear complexitymultisequencesmultidimensional arraysperiodic arraysmultidimensional linear complexity
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Communication theory (94A05)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling the shrinking generator in terms of linear CA
- On the linear complexity of binary lattices
- Improved results on the probabilistic theory of the joint linear complexity of multisequences
- On linear complexity of binary lattices. II
- On finite pseudorandom binary lattices
- Extension of the Berlekamp-Massey algorithm to N dimensions
- Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
- The asymptotic behavior of the joint linear complexity profile of multisequences
- Construction of pseudorandom binary lattices based on multiplicative characters
- Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
- Gröbner bases and primary decomposition of polynomial ideals
- The stability theory of stream ciphers
- The expected value of the joint linear complexity of periodic multisequences
- On the linear complexity for multidimensional sequences
- More constructions of pseudorandom lattices of \(k\) symbols
- Discrete linear models for the generalized self-shrunken sequences
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Construction of pseudorandom binary lattices by using the multiplicative inverse
- Finding a Gröbner basis for the ideal of recurrence relations on m-dimensional periodic arrays
- Handbook of Finite Fields
- New Optimal Low Correlation Sequences for Wireless Communications
- Measures of pseudorandomness of finite binary lattices, I. The measures Qk, normality
- Construction of pseudorandom binary lattices using elliptic curves
- The Probabilistic Theory of Linear Complexity
- Shift-register synthesis and BCH decoding
