On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
From MaRDI portal
Publication:3541922
DOI10.1007/11863854_17zbMath1152.94388OpenAlexW1551055010MaRDI QIDQ3541922
Dengguo Feng, Lei Hu, Hong Gang Hu
Publication date: 27 November 2008
Published in: Sequences and Their Applications – SETA 2006 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11863854_17
Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (3)
On the joint 2-adic complexity of binary multisequences ⋮ On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction
This page was built for publication: On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences