SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER
From MaRDI portal
(Redirected from Publication:5074008)
Cites work
- A general construction of binary interleaved sequences of period \(4{N}\) with optimal autocorrelation
- A New Systematic Construction of Zero Correlation Zone Sequences Based on Interleaved Perfect Sequences
- About the linear complexity of quaternary sequences with even length
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Cross correlation of m-sequences of different lengths
- Expansion complexity and linear complexity of sequences over finite fields
- scientific article; zbMATH DE number 5831618 (Why is no real title available?)
- scientific article; zbMATH DE number 1740057 (Why is no real title available?)
- Interleaved Caching with Access Graphs
- Linear complexity of generalized sequences by comparison of PN-sequences
- New Binary Sequences With Optimal Autocorrelation Magnitude
- New Constructions of Binary Sequences With Optimal Autocorrelation Value/Magnitude
- Notes on \(q\)-ary interleaved sequences
- On interleaved sequences over finite fields
- On shift sequences for interleaved construction of signal sets with low correlation
- On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
- Open problems on the cross-correlation of m-sequences
- Synthesis of cryptographic interleaved sequences by means of linear cellular automata
This page was built for publication: SOME METHODS TO DESIGN INTERLEAVED SEQUENCES OVER
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074008)
