The 2-adic complexity of a class of LFSR sequence families

MaRDI QIDQ2993409zbMATH OpenFDO

Authors Xin Liu

Publication date 10 August 2016

zbMATH Keywords

2-adic complxityfeedbck with carry shift registr (FCSR) sequenceslinear complxitylinear feedback register (LFSR) quence familiesminimal connection integer

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Study of 2-adic complexity of a class of binary sequences with optimal autocorrelation values
• 2-adic complexity of two classes of generalized cyclotomic binary sequences
• On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• 2-Adic shift registers

Cited in

(1)

• Proof of a conjecture and a bound on the imbalance properties of LFSR subsequences

This page was built for publication: The 2-adic complexity of a class of LFSR sequence families

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