Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period p q
DOI10.3934/AMC.2023017zbMATH Open1547.94288MaRDI QIDQ6605886FDOQ6605886
Authors: Vladimir Edemskiy
Publication date: 16 September 2024
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Recommendations
Random number generation in numerical analysis (65C10) Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)
Cites Work
- Title not available (Why is that?)
- Feedback shift registers, 2-adic span, and combiners with memory
- Algebraic Shift Register Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
- Theory and applications of q-ary interleaved sequences
- The Linear Complexity of Binary Sequences With Optimal Autocorrelation
- Construction of quaternary sequences of length \(pq\) with low autocorrelation
- New \(M\)-ary sequences with low autocorrelation from interleaved technique
- On the 2-Adic Complexity of the Two-Prime Generator
- On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences
- On the 4-adic complexity of the two-prime quaternary generator
- 2-Adic and Linear Complexities of a Class of Whiteman’s Generalized Cyclotomic Sequences of Order Four
- The linear complexity and 4-adic complexity of quaternary sequences with period \(pq\)
Cited In (2)
This page was built for publication: Symmetric 4-adic complexity of quaternary sequences with low autocorrelation and period \(p q\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605886)