FCSR periodic multisequences with maximal joint N-adic complexity and large k-error joint N-adic complexity over Z/(N)

DOI10.1007/S11424-014-2265-ZzbMATH Open1395.94296OpenAlexW2022700917MaRDI QIDQ488927FDOQ488927

Authors: Fulin Li, Shixin Zhu, Hong Gang Hu 

Publication date: 27 January 2015

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-014-2265-z

Recommendations

• Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)
• A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence
• On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
• On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• On the joint 2-adic complexity of binary multisequences
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n
• scientific article; zbMATH DE number 2247712
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Periodic multisequences with large error linear complexity

zbMATH Keywords

cryptographystream cipher\(N\)-adic numbers\(k\)-error joint \(N\)-adic complexityjoint \(N\)-adic complexity

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Algebraic coding theory
• The stability theory of stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• Algebraic Shift Register Sequences
• 2-Adic shift registers
• A Survey of Feedback with Carry Shift Registers
• Fast Software Encryption
• Periodic multisequences with large error linear complexity
• Periodic sequences with large k-error linear complexity
• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
• New Results on Periodic Sequences With Large $k$-Error Linear Complexity
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Register synthesis for algebraic feedback shift registers based on non-primes
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n
• Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
• Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)
• Title not available (Why is that?)
• Improved results on periodic multisequences with large error linear complexity

Cited In (3)

• Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)
• The asymptotic behavior of \(N\)-adic complexity
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n

This page was built for publication: FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)

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