Linear complexity for a class of balanced binary sequences of period p^m+1q^n+1

DOI10.3969/J.ISSN.2095-4298.2015.02.007MaRDI QIDQ3462967zbMATH OpenFDO

Authors Weitao Fang, Qin Yue

Publication date 15 January 2016

Full work available at URL https://doi.org/10.3969/J.ISSN.2095-4298.2015.02.007

zbMATH Keywords

binary sequencegeneralized cyclotomylinear complexity

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Linear complexity of generalized cyclotomic binary sequences of period \(pq\)
• The linear complexity of a class of binary sequences with period \(2p\)
• Linear complexity of generalized cyclotomic sequences of period \(2p^m\)
• On the linear complexity and autocorrelation of generalized cyclotomic binary sequences with period 4p^n
• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)

Cited in

(5)

• Binary sequences of period \(2^m-1\) with large linear complexity
• Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences
• The linear complexity of binary sequences with period (2/sup n/-1)/sup k/
• The linear complexity of a class of binary sequences with period \(2p\)
• The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation

This page was built for publication: Linear complexity for a class of balanced binary sequences of period \(p^{m+1}q^{n+1}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462967)