On the joint 2-adic complexity of binary multisequences

DOI10.1051/ita/2012011zbMath1277.94010OpenAlexW2128689820MaRDI QIDQ2905327

Qiao-Yan Wen, Lu Zhao

Publication date: 27 August 2012

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=ITA_2012__46_3_401_0/

zbMATH Keywords

Fourier transformcryptographystream cipherFCSRjoint 2-adic complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Related Items (2)

On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction

Cites Work

• Error linear complexity measures for multisequences
• Joint linear complexity of multisequences consisting of linear recurring sequences
• Feedback shift registers, 2-adic span, and combiners with memory
• The expected value of the joint linear complexity of periodic multisequences
• Linear complexity, \(k\)-error linear complexity, and the discrete Fourier transform
• On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
• A lower bound on the linear span of an FCSR
• Fourier transforms and the 2-adic span of periodic binary sequences

This page was built for publication: On the joint 2-adic complexity of binary multisequences