Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2pm
From MaRDI portal
Publication:2819181
DOI10.1142/S0219691316500405zbMath1348.94025OpenAlexW2488261783MaRDI QIDQ2819181
Xu Li, Xuewu Zuo, Lixiang Xu, Jin Xiao, Rashid Abbasi, Yuan Yan Tang
Publication date: 28 September 2016
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219691316500405
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Sequences (mod (m)) (11B50)
Related Items (2)
The estimate of the linear complexity of generalized cyclotomic binary and quaternary sequences with periods \(p^n\) and \(2p^n\) ⋮ Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\)
Cites Work
- Linear complexity of Ding-Helleseth sequences of order 2 over \(\mathrm{GF}(l)\)
- Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
- On the Autocorrelation and the Linear Complexity of q-Ary Prime n-Square Sequences
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Linear Complexity of Some Generalized Cyclotomic Sequences
This page was built for publication: Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2pm
