The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:X4PQJDZMrecord.jsonopen to challenge →
classification
cs.IT
math.IT
keywords
sequencesadiccomplexitybinaryclassesalgorithmapproximationattack
read the original abstract
The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack of the rational approximation algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.