SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER

DOI10.17654/0972555522005zbMath1499.11090OpenAlexW4206550592WikidataQ114049347 ScholiaQ114049347MaRDI QIDQ5074008

Mame Abdou Diaw, Alhousseynou Ba, Chérif Bachir Deme, Oumar Diankha, Oumar Fall

Publication date: 6 May 2022

Published in: JP Journal of Algebra, Number Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/0972555522005

zbMATH Keywords

algorithm\(m\)-sequencedecimationinterleaved sequenceminimum polynomialclass vector

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Automata sequences (11B85) Sequences (mod (m)) (11B50)

Cites Work

• Unnamed Item
• Unnamed Item
• A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation
• Expansion complexity and linear complexity of sequences over finite fields
• Synthesis of cryptographic interleaved sequences by means of linear cellular automata
• Notes on \(q\)-ary interleaved sequences
• On interleaved sequences over finite fields
• About the linear complexity of quaternary sequences with even length
• Linear complexity of generalized sequences by comparison of PN-sequences
• On shift sequences for interleaved construction of signal sets with low correlation
• Cross correlation of m-sequences of different lengths
• A New Systematic Construction of Zero Correlation Zone Sequences Based on Interleaved Perfect Sequences
• New Binary Sequences With Optimal Autocorrelation Magnitude
• Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
• New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
• On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence
• Interleaved Caching with Access Graphs
• Open Problems on the Cross-correlation of m-Sequences

This page was built for publication: SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER