Linear complexity of binary sequences based on two-fold cyclotomy

MaRDI QIDQ2993173zbMATH OpenFDO

Authors Yuying Sun, Wenli Ren

Publication date 10 August 2016

zbMATH Keywords

binary sequencecyclotomylinear complexity

Mathematics Subject Classification ID

Cyclotomy (11T22) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
• Autocorrelation values and linear complexity of new generalized cyclotomic sequences
• Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2p^m
• Linear complexity of binary cyclotomic sequences of order 6
• Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>

Cited in

(3)

• Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2p^m
• scientific article; zbMATH DE number 5150220 (Why is no real title available?)
• On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function

This page was built for publication: Linear complexity of binary sequences based on two-fold cyclotomy

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