Linear complexity of generalized cyclotomic binary sequences of length \(2p^{m}\)
From MaRDI portal
Publication:964736
DOI10.1007/s00200-009-0116-2zbMath1184.94222MaRDI QIDQ964736
Jingwei Zhang, Chang-An Zhao, Xi-Ao Ma
Publication date: 20 April 2010
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-009-0116-2
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
The linear complexity of a class of binary sequences with period \(2p\), The linear complexity of generalized cyclotomic sequences with period \(2p^n\), Remarks on the generalized cyclotomic sequences of length \(2p^m\), On the linear complexity and the autocorrelation of generalized cyclotomic binary sequences of length \(2p^m\), Linear complexity of a new class of quaternary generalized cyclotomic sequence with period \(2 p^m\), Linear complexity of generalized cyclotomic sequences of period \(2p^m\), Linear complexity of generalized cyclotomic binary sequences of order 2d and length 2pm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear complexity of generalized cyclotomic binary sequences of order 2
- New generalized cyclotomy and its applications
- On the linear complexity of generalized cyclotomic sequences with the period \(p^m\)
- Linear Complexity of New Generalized Cyclotomic Sequences of Order Two of Length<tex>$pq$</tex>
- Autocorrelation values of generalized cyclotomic sequences of order two
- Cyclotomy and duadic codes of prime lengths
- Generalized cyclotomic codes of length p/sub 1//sup e(1)/...p/sub t//sup e(t)/
- Linear Complexity of Some Generalized Cyclotomic Sequences
- Linear Complexity and Autocorrelation of Prime Cube Sequences
