Analysis and computation of multidimensional linear complexity of periodic arrays

DOI10.1007/s10623-023-01274-warXiv2207.14398OpenAlexW4385461866MaRDI QIDQ6130614

No author found.

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

informationsecuritydigital watermarkingcomposition methodBerlekamp-Masseylinear complexity and multidimensional arrays

Mathematics Subject Classification ID

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

Cites Work

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