Analysis and computation of multidimensional linear complexity of periodic arrays

DOI10.1007/S10623-023-01274-WMaRDI QIDQ6130614zbMATH OpenOpenAlexFDO

Authors

Publication date 3 April 2024

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2207.14398

zbMATH Keywords

Berlekamp-Masseycomposition methoddigital watermarkinginformationlinear complexity and multidimensional arrayssecurity

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Polynomials over finite fields (11T06) Information theory (general) (94A15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Authentication, digital signatures and secret sharing (94A62)

Abstract: Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of two and three dimensional arrays, and present new results on the multidimensional linear complexity of periodic arrays obtained using the definition and method proposed in cite{ArCaGoMoOrRuTi,GoHoMoRu,MoHoRu}. The results include a generalization of a bound for the linear complexity, a comparison with the measure of complexity for multisequences, and computations of the complexity of arrays with periods that are not relatively prime for which the ``unfolding method does not work. Conjectures for exact formulas and the asymptotic behavior of the complexity of some array constructions are formulated. We also present open source software for constructing multidimensional arrays and for computing their multidimensional linear complexity.

Recommendations

• Multidimensional linear complexity analysis of periodic arrays
• On the linear complexity for multidimensional sequences
• Joint linear complexity of periodic multi-sequences
• scientific article; zbMATH DE number 1151817
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

Cites work

• n-dimensional optical orthogonal codes, bounds and optimal constructions
• A new family of frequency-hop codes.
• Arrays composed from the extended rational cycle
• Extension of the Berlekamp-Massey algorithm to N dimensions
• Finding a Gröbner basis for the ideal of recurrence relations on m-dimensional periodic arrays
• scientific article; zbMATH DE number 1182117 (Why is no real title available?)
• Multidimensional linear complexity analysis of periodic arrays
• New asymptotically optimal three-dimensional wave-length/space/time optical orthogonal codes for OCDMA systems
• New Optimal Low Correlation Sequences for Wireless Communications
• Shift-register synthesis and BCH decoding
• The expected value of the joint linear complexity of periodic multisequences

This page was built for publication: Analysis and computation of multidimensional linear complexity of periodic arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6130614)