REVIEW
The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The 2-Adic Complexity of Two Classes of Binary Sequences with Interleaved Structure
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.